6343 search results - page 30 / 1269 » Robust consensus computation |
PDCAT
2005
Springer
15 years 3 months ago
2005
Springer
Fault tolerant algorithms are often designed under the t-out-of-n assumption, which is based on the assumption that all processes or components fail independently with equal proba...
DSN
2007
IEEE
15 years 1 months ago
2007
IEEE
Model-checking of asynchronous distributed protocols is challenging because of the large size of the state and solution spaces. This paper tackles this problem in the context of l...
ICPR
2010
IEEE
14 years 12 months ago
2010
IEEE
Offline handwriting recognition (OHR) is an extremely challenging task because of many factors including variations in writing style, writing device and material, and noise in the ...
SIGECOM
2010
ACM
15 years 2 months ago
2010
ACM
One of the fundamental problems in the theory of social choice is aggregating the rankings of a set of agents (or voters) into a consensus ranking. Rank aggregation has found appl...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...