Sciweavers

3047 search results - page 6 / 610
» A Temporal Consensus Model
Sort
View
ICS
2010
Tsinghua U.
15 years 7 months ago
Reaching Consensus on Social Networks
Abstract: Research in sociology studies the effectiveness of social networks in achieving computational tasks. Typically the agents who are supposed to achieve a task are unaware o...
Elchanan Mossel, Grant Schoenebeck
SAC
2010
ACM
15 years 4 months ago
Asynchronous Byzantine consensus with 2f+1 processes
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
Miguel Correia, Giuliana Santos Veronese, Lau Cheu...
STOC
2001
ACM
147views Algorithms» more  STOC 2001»
15 years 10 months ago
Conditions on input vectors for consensus solvability in asynchronous distributed systems
This article introduces and explores the condition-based approach to solve the consensus problem in asynchronous systems. The approach studies conditions that identify sets of inpu...
Achour Mostéfaoui, Michel Raynal, Sergio Ra...
SIGECOM
2010
ACM
183views ECommerce» more  SIGECOM 2010»
15 years 2 months ago
The unavailable candidate model: a decision-theoretic view of social choice
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...
Tyler Lu, Craig Boutilier
PDCAT
2009
Springer
15 years 4 months ago
Modular Consensus Algorithms for the Crash-Recovery Model
—In the crash-recovery failure model of asynchronous distributed systems, processes can temporarily stop to execute steps and later restart their computation from a predefined l...
Felix C. Freiling, Christian Lambertz, Mila E. Maj...