Now showing items 11-20 of 35
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 Performance of Copying Large Files Across a Contention-Based Network
(Center for Information Technology Integration, 1989-06-12)
Analytical and simulation models of interconnected local area networks, because of the large scale involved, are often constrained to represent only the most ideal of conditions for tractability sake. Consequently, many ...
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 ...
A zero-one law for logic with a fixed-point operator
(Elsevier, 1985)
The logic obtained by adding the least-fixed-point operator to first-order logic was proposed as a query language by Aho and Ullman (in "Proc. 6th ACM Sympos. on Principles of Programming Languages," 1979, pp. 110-120) and ...
Classifier systems and genetic algorithms
(Elsevier, 1989-09)
Classifier systems are massively parallel, message-passing, rule-based systems that learn through credit assignment (the bucket brigade algorithm) and rule discovery (the genetic algorithm). They typically operate in ...
A continuous information theoretic approach to the analysis of cutaneous receptor neurons
(Springer-Verlag, 1983-05)
Information theoretic and statistical techniques for determining the number of discernible levels in cutaneous receptor neurons are reviewed. Reasons for the large variance in these results are discussed. A new continuous ...
Channel distances and representation
(Elsevier, 1982)
The properties of several distance measures for discrete stationary channels with memory are studied. All are based on Ornstein's {if238-1}-random process distance. The strongest of these distances has been employed in a ...
A computer program for linear nonparametric and parametric identification of biological data
(Elsevier, 1984)
A computer program package for parametric and nonparametric linear system identification of both static and dynamic biological data, written for an LSI-11 minicomputer with 28 K of memory, is described. The program has 11 ...
Connections between two theories of concurrency: Metric spaces and synchronization trees
(Elsevier, 1983)
A connection is established between the semantic theories of concurrency and communication in the works of de Bakker and Zucker, who develop a denotational semantics of concurrency using metric spaces instead of complete ...
Simplified analysis of a hyperbolic system
(Elsevier, 1985)
The method of generating equation is used in order to reduce a weakly nonlinear hyperbolic system to the standard form, i.e. the form which admits an asymptotic treatment based on the averaging principle.