5 search results - page 1 / 1 » Randomization Can Be a Healer: Consensus with Dynamic Omissi... |
WDAG
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Wireless ad-hoc networks are being increasingly used in diverse contexts, ranging from casual meetings to disaster recovery operations. A promising approach is to model t...
WDAG
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We give randomized agreement algorithms with constant expected running time in asynchronous systems subject to process failures, where up to a minority of processes may f...
106
click to vote
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract-- We study the convergence rate of average consensus algorithms in networks with stochastic communication failures. We show how the system dynamics can be modeled by a dis...
ICASSP
2010
IEEE
14 years 9 months ago
2010
IEEE
We consider the weight design problem for the consensus algorithm under a finite time horizon. We assume that the underlying network is random where the links fail at each iterat...
PODC
1990
ACM
15 years 1 months ago
1990
ACM
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...