Now showing items 371-378 of 378
Techniques for efficiently implementing totally self-checking checkers in MOS technology
(Elsevier, 1987)
This paper presents some new techniques for reducing the transistor count oof MOS implementations of totally self-checking (TSC) checkers. The techniques are (1) transfer of fanouts, (2) removal of inverters and (3) use ...
Average case completeness
(Elsevier, 1991-06)
We explain and advance Levin's theory of average case completeness. In particular, we exhibit examples of problems complete in the average case and prove a limitation on the power of deterministic reductions.
Novel applications of information retrieval to the storage and management of computer models
(Elsevier, 1989)
Decision-making is often supported by computer-based models. To become a truly valuable corporate resource, such models must be easy to locate, share, and reuse. We describe a technical approach to model management aimed ...
Automated solutions of breathing pattern optimizations
(Elsevier, 1994-05)
A numerical procedure which allows the convenient exploration of various optimization hypotheses of breathing pattern regulation is described. The method is based on the calculus of variations and uses a novel technique ...
Relevance odds of retrieval overlaps from seven search fields
(Elsevier, 1994)
Data contained in a 1982 paper were analyzed in terms of relevance odds of common items retrieved by searching any two content-bearing search fields. While the 1982 study compared the relative retrieval performance of 7 ...
Subcube Fault-Tolerance in Hypercubes
(Elsevier, 1993-02)
We consider the problem of determining the minimum number of faulty processors, K(n, m), and of faulty links, [lambda](n, m), in an n-dimensional hypercube computer so that every m-dimensional subcube is faulty. Best known ...