Terminating Distributed Construction of Shapes and Patterns in a Fair Solution of Automata
From MaRDI portal
Publication:2796239
DOI10.1145/2767386.2767402zbMath1333.68067arXiv1503.01913OpenAlexW2157203763MaRDI QIDQ2796239
Publication date: 23 March 2016
Published in: Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1503.01913
populationfairnessself-organizationdistributed protocolnetwork constructionprogrammable mattershape formationinteracting automatarandom schedule
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Distributed systems (68M14) Network protocols (68M12)
Related Items
An Introduction to Temporal Graphs: An Algorithmic Perspective, Terminating distributed construction of shapes and patterns in a fair solution of automata, Network Constructors: A Model for Programmable Matter, Connectivity preserving network transformers, Connectivity Preserving Network Transformers, Simple and efficient local codes for distributed stable network construction, An Introduction to Temporal Graphs: An Algorithmic Perspective*
Cites Work