Optimum network design using NOR-OR gates by integer programming.

"Supported in part by ... Grant no. NSF GJ-503."

VIPTRAN2 : an improved programming language and its compiler for process control equations /

Mode of access: Internet.

The design of NOR networks under fan-in and fan-out const[r]aints : a programming manual for FIFOTRAN-G1 /

"Report No. UIUCDCS-R-74-661"

Show-and-Tell; an interactive programming system for image processing.

Includes bibliographical references.

MIMIC programming manual /

Photocopy of typescript. Springfield, Va.: Reproduced by National Technical Information Service, [1975?] -- 28 cm.

Simulation system programming design manual /

"Contract no. N61339-1089."

Specifications and test methods for numeric accuracy in programming language standards /

Item 247.

Computer model documentation guide /

Item 247.

A testbed for providing uniformity to user-computer interaction languages /

"Issued August 1980."

The design of an economically viable large-scale computer based education system /

"February, 1969"

CDM3/linear programming.

On cover: Control data, 1604/1604-A computer.

An introduction to ALGOL programming

Bibliography: p. 121.

Influence apart from Adoption: How Interaction between Programming and Scientific Practices Shapes Modes of Inquiry in Four Oceanography Teams

Thesis (Ph.D.)--University of Washington, 2016-06

Embedding defeasible logic into logic programming

Defeasible reasoning is a simple but efficient approach to nonmonotonic reasoning that has recently attracted considerable interest and that has found various applications. Defeasible logic and its variants are an important family of defeasible reasoning methods. So far no relationship has been established between defeasible logic and mainstream nonmonotonic reasoning approaches. In this paper we establish close links to known semantics of logic programs. In particular, we give a translation of a defeasible theory D into a meta-program P(D). We show that under a condition of decisiveness, the defeasible consequences of D correspond exactly to the sceptical conclusions of P(D) under the stable model semantics. Without decisiveness, the result holds only in one direction (all defeasible consequences of D are included in all stable models of P(D)). If we wish a complete embedding for the general case, we need to use the Kunen semantics of P(D), instead.

Fast stereo matching by iterated dynamic programming and quadtree subregioning

The application of energy minimisation methods for stereo matching has been demonstrated to produce high quality disparity maps. However the majority of these methods are known to be computationally expensive, requiring minutes or even hours of computation. We propose a fast minimisation scheme that produces strongly competitive results for significantly reduced computation, requiring only a few seconds of computation. In this paper, we present our iterated dynamic programming algorithm along with a quadtree subregioning process for fast stereo matching.