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 agents interact in pairs under the control of an adversary scheduler, where all pairs are equally likely to be chosen for...

Celý popis

Podrobná bibliografie

Vydáno v:	Distributed computing Ročník 21; číslo 3; s. 183 - 199
Hlavní autoři:	Angluin, Dana, Aspnes, James, Eisenstat, David
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Berlin/Heidelberg Springer-Verlag 01.09.2008 Springer Nature B.V
Témata:	Computer Communication Networks Computer Hardware Computer Science Computer Systems Organization and Communication Networks Software Engineering/Programming and Operating Systems Theory of Computation Parallel Time Infected Node Turing Machine Leader Election Phase Clock
ISSN:	0178-2770, 1432-0452
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!