Computation in networks of passively mobile finite-state sensors
From MaRDI portal
Publication:5501509
DOI10.1145/1011767.1011810zbMath1321.68058WikidataQ62472227 ScholiaQ62472227MaRDI QIDQ5501509
René Peralta, Dana Angluin, James Aspnes, Michael J. Fischer, Zoë Diamadi
Publication date: 3 August 2015
Published in: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1011767.1011810
mobile agent; diffuse computation; finite-state agent; intermittent communication; stable computation; sensor net
Related Items
The computational power of simple protocols for self-awareness on graphs, On the number of binary-minded individuals required to compute \(\sqrt {\frac 12}\), Mediated population protocols, A self-stabilizing transformer for population protocols with covering, On the convergence of population protocols when population goes to infinity, The computational power of population protocols, Fast computation by population protocols with a leader, Recent Advances in Population Protocols, The Dynamics of Probabilistic Population Protocols, Labelled (Hyper)Graphs, Negotiations and the Naming Problem