Sciweavers

481 search results - page 4 / 97
» Distributed Consensus, revisited
Sort
View
OPODIS
2008
13 years 9 months ago
With Finite Memory Consensus Is Easier Than Reliable Broadcast
We consider asynchronous distributed systems with message losses and process crashes. We study the impact of finite process memory on the solution to consensus, repeated consensus ...
Carole Delporte-Gallet, Stéphane Devismes, ...
ICASSP
2009
IEEE
14 years 2 months ago
Interval consensus: From quantized gossip to voting
We design distributed and quantized average consensus algorithms on arbitrary connected networks. By construction, quantized algorithms cannot produce a real, analog average. Inst...
Florence Bénézit, Patrick Thiran, Ma...
ICASSP
2011
IEEE
12 years 11 months ago
Consensus-based distributed particle filtering algorithms for cooperative blind equalization in receiver networks
We describe in this paper novel consensus-based distributed particle filtering algorithms which are applied to cooperative blind equalization of frequency-selective channels in a...
Claudio J. Bordin, Marcelo G. S. Bruno
AUTOMATICA
2008
115views more  AUTOMATICA 2008»
13 years 7 months ago
Distributed algorithms for reaching consensus on general functions
This paper presents analysis and design results for distributed consensus algorithms in multi-agent networks. We consider continuous consensus functions of the initial state of th...
Jorge Cortés
ISPDC
2006
IEEE
14 years 1 months ago
Optimistically Terminating Consensus: All Asynchronous Consensus Protocols in One Framework
Optimistically Terminating Consensus (OTC) is a variant of Consensus that decides if all correct processes propose the same value. It is surprisingly easy to implement: processes ...
Piotr Zielinski