Sciweavers

203 search results - page 4 / 41
» Mediated Population Protocols
Sort
View
WDAG
2007
Springer
79views Algorithms» more  WDAG 2007»
15 years 3 months ago
A Simple Population Protocol for Fast Robust Approximate Majority
We describe and analyze a 3-state one-way population protocol to compute approximate majority in the model in which pairs of agents are drawn uniformly at random to interact. Given...
Dana Angluin, James Aspnes, David Eisenstat
CORR
2008
Springer
115views Education» more  CORR 2008»
14 years 10 months ago
Playing With Population Protocols
Population protocols have been introduced as a model of sensor networks consisting of very limited mobile agents with no control over their own movement: A collection of anonymous ...
Olivier Bournez, Jérémie Chalopin, J...
OPODIS
2007
14 years 11 months ago
Secretive Birds: Privacy in Population Protocols
We study private computations in a system of tiny mobile agents. We consider the mobile population protocol model of Angluin et al. [2] and ask what can be computed without ever re...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
DCOSS
2006
Springer
15 years 1 months ago
When Birds Die: Making Population Protocols Fault-Tolerant
In the population protocol model introduced by Angluin et al. [2], a collection of agents, which are modelled by finite state machines, move around unpredictably and have pairwise ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
DC
2008
14 years 9 months ago
Fast computation by population protocols with a leader
Fast algorithms are presented for performing computations in a probabilistic population model. This is a variant of the standard population protocol model--in which finite-state ag...
Dana Angluin, James Aspnes, David Eisenstat