Now showing items 1-10 of 25
On the statistics of random pulse processes
(Elsevier, 1971-05)
Statistics are obtained for pulse trains in which the pulse shapes as well as the time base are random. The general expression derived for the mean and spectral density of the pulse train require neither independence of ...
An efficient job scheduling algorithm for mixed turnaround and deadline applications
(Elsevier, 1978-11)
Computer job scheduling is often performed with little understanding of the formal properties of the jobs being scheduled. One reason for this is that optimal solutions for job scheduling on computers are difficult to ...
Dimensioning of an ATM switch with shared buffer and threshold priority
(Elsevier, 1993-09)
A number of recent studies have addressed the use of priority mechanisms in Asynchronous Transfer Mode (ATM) switches. This investigation concerns the performance evaluation and dimensioning of a shared-buffer switching ...
A logic for constant-depth circuits
(Elsevier, 1984-04)
Consider a family of boolean circuitsC1,C2,...,Cn,..., constructed by some uniform, effective procedure operating on inputn. Such a procedure provides a concise representation of a family of parallel algorithms for computing ...
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 ...
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}}. ...
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 ...
Usage refinement for ER-to-relation design transformations
(Elsevier, 1991-06)
Database schema refinement based on usage is proposed as a useful next step in a practical database design methodology founded upon entity-relationship (ER) conceptual modeling and transformation to normalized relations. ...
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 ...