Now showing items 21-30 of 81
On the relationships between Scott domains, synchronization trees, and metric spaces
(Elsevier, 1985)
We use Scott's idea of information systems to provide a complete partial order semantics for concurrency involving Milner's synchronization tree model. Several connections are investigated between different models; our ...
The decentralized wald problem
(Elsevier, 1987-04)
Two detectors making independent observations must decide which one of two hypotheses is true. The decisions are coupled through a common cost function. It is shown that the detectors' optimal decisions are characterized ...
Digital metrics: A graph-theoretical approach
(Elsevier, 1984-03)
Consider the following two graphs M and N, both with vertex set Z x Z, where Z is the set of all integers. In M, two vertices are adjacent when their euclidean distance is 1, while in N, adjacency is obtained when the ...
Representations and algorithms for cognitive learning
(Elsevier, 1974)
This is a report summarizing our progress towards a theory of cognitive learning. It is concerned with an algorithm that recognizes, selects and formulates in an internal language problems that arise in an external ...
The spectral analysis of impulse processes
(Elsevier, 1968-03)
An expression for the spectral density of the impulse process s(t) = {if236-1} is derived under the assumption that [alpha]n}} is a stationary process, and that n}} is a stationary point process independent of [alpha]n}}. ...
A comparison of selected pattern recognition functions
(Elsevier, 1977-07)
In this study computer simulation is used to compare selected pattern recognition functions. The Highleyman deck of 50 hand written characters provides one comparative data base. A second data base is derived from multispectral ...
Evaluation of likelihood functions
(Elsevier, 1968-07)
An expression is obtained for the likelihood function for the detection of a stochastic signal (diffusion process) in white noise. A stochastic differential equation is then obtained for the evolution of the likelihood ...
The computational complexity of asymptotic problems I: Partial orders
(Elsevier, 1988-08)
The class of partial orders is shown to have 0-1 laws for first-order logic and for inductive fixed-point logic, a logic which properly contains first-order logic. This means that for every sentence in one of these logics ...
On the unique satisfiability problem
(Elsevier, 1982)
UNIQUE SAT is the problem of deciding whether a given Boolean formula has exactly one satisfying truth assignment. This problem is a typical (moreover complete) representative of a natural class of problems about unique ...