1352 search results - page 58 / 271 » Fault-Tolerant Quantum Computation |
NSDI
2007
13 years 10 months ago
2007
Byzantine fault tolerant systems behave correctly when no more than f out of 3f + 1 replicas fail. When there are more than f failures, traditional BFT protocols make no guarantee...
DSN
2005
IEEE
13 years 9 months ago
2005
IEEE
The increasing transient fault rate will necessitate onchip fault tolerance techniques in future processors. The speed gap between the processor and the memory is also increasing,...
SERSCISA
2010
Springer
13 years 9 months ago
2010
Springer
With the explosive growth of digital music, content-based music information retrieval especially query by humming/singing have been attracting more and more attention and are beco...
FGCS
2010
13 years 6 months ago
2010
Evolutionary Algorithms, including Genetic Programming (GP), are frequently employed to solve difficult real-life problems, which can require up to days or months of computation. ...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
Abstract—In this paper, we implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: (1) BASIC: The classic solu...