89 search results - page 12 / 18 » Fast Byzantine Consensus |
155
Voted
BMCBI
2008
15 years 3 months ago
2008
Background: Inferring cluster structure in microarray datasets is a fundamental task for the so-called -omic sciences. It is also a fundamental question in Statistics, Data Analys...
104
click to vote
IPL
2008
15 years 3 months ago
2008
Fast Paxos is an algorithm for consensus that works by a succession of rounds, where each round tries to decide a value v that is consistent with all past rounds. Rounds are start...
143
click to vote
EDCC
2010
Springer
15 years 8 months ago
2010
Springer
Implementing a fault-tolerant state machine boils down to reaching consensus on a sequence of commands. In wide area networks (WANs), where network delays are typically large and ...
150
Voted
ICDCS
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we focus our attention on the problem of automating the addition of failsafe fault-tolerance where fault-tolerance is added to an existing (fault-intolerant) progra...
153
Voted
INFORMATICALT
2006
15 years 3 months ago
2006
Generally, the task in a distributed system must achieve an agreement. It requires a set of processors to agree on a common value even if some components are corrupted. There are s...