The computational power of self-stabilizing distributed systems is examined. Assuming availability of any number of processors, each with (small) constant size memory we show that any computable problem can be realized in a self-stabilizing fashion. The result is derived by presenting a distributed
β¦ LIBER β¦
The computational power of simple protocols for self-awareness on graphs
β Scribed by Chatzigiannakis, Ioannis; Michail, Othon; Nikolaou, Stavros; Spirakis, Paul G.
- Book ID
- 123225668
- Publisher
- Elsevier Science
- Year
- 2013
- Tongue
- English
- Weight
- 455 KB
- Volume
- 512
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
On the computational power of self-stabi
β
James Abello; Shlomi Dolev
π
Article
π
1997
π
Elsevier Science
π
English
β 859 KB
The impact of computer-mediated communic
β
Matheson, Kimberly; Zanna, Mark P.
π
Article
π
1988
π
Elsevier Science
π
English
β 914 KB
On the generating graph of direct powers
β
Timothy C. Burness, Eleonora Crestani
π
Article
π
2012
π
Springer
π
English
β 733 KB
[Lecture Notes in Computer Science] Appl
β
Giacobini, Mario
π
Article
π
2007
π
Springer Berlin Heidelberg
π
German
β 441 KB
This Book Constitutes The Refereed Joint Proceedings Of Seven Workshops On Evolutionary Computing, Evoworkshops 2007, Held In Valencia, Spain In April 2007. It Examines Evolutionary Computation In Communications, Networks, And Connected Systems; Finance And Economics; Image Analysis And Signal Proce
Upper bounds on the sum of powers of the
β
Jochen Harant; Stanislav Jendrol; TomΓ‘Ε‘ Madaras
π
Article
π
2010
π
John Wiley and Sons
π
English
β 131 KB
π 1 views
On the optimality of a simple strategy f
β
Shmuel Gal
π
Article
π
2001
π
Springer-Verlag
π
English
β 105 KB