Sciweavers

1352 search results - page 122 / 271
» Fault-Tolerant Quantum Computation
Sort
View
DAC
2005
ACM
13 years 10 months ago
Response compaction with any number of unknowns using a new LFSR architecture
This paper presents a new test response compaction technique with any number of unknown logic values (X’s) in the test response bits. The technique leverages an X-tolerant respo...
Erik H. Volkerink, Subhasish Mitra
IVEVA
2004
13 years 9 months ago
Giving Embodied Agents a Grid-Boost
Grid technology has been widely used for large-scale computational problems, but it also provides a framework for running a big number of smallsized processes. Moreover, these proc...
José A. Pérez, Carlos Delgado-Mata, ...
NSDI
2004
13 years 9 months ago
Constructing Services with Interposable Virtual Hardware
Virtual machine monitors (VMMs) have enjoyed a resurgence in popularity, since VMMs can help to solve difficult systems problems like migration, fault tolerance, code sandboxing, ...
Andrew Whitaker, Richard S. Cox, Marianne Shaw, St...
CACM
2005
59views more  CACM 2005»
13 years 7 months ago
Is the thrill gone?
een program and data, abstraction, recursion, tractability, virtualization, and fault tolerance are among its basic principles. No one would dispute that the very idea of computing...
Sanjeev Arora, Bernard Chazelle
JSS
1998
90views more  JSS 1998»
13 years 7 months ago
A taxonomy of distributed termination detection algorithms
An important problem in the ®eld of distributed systems is that of detecting the termination of a distributed computation. Distributed termination detection (DTD) is a dicult p...
Jeff Matocha, Tracy Camp