The complexity of Boolean functions
The complexity of Boolean functions
Neural and automata networks: dynamical behavior and applications
Neural and automata networks: dynamical behavior and applications
Cellular automata: theory and experiment
Cellular automata: theory and experiment
On the hardness of approximate reasoning
Artificial Intelligence
Multiagent systems: a modern approach to distributed artificial intelligence
Multiagent systems: a modern approach to distributed artificial intelligence
Elements of a theory of computer simulation I: sequential CA over random graphs
Applied Mathematics and Computation
Elements of a theory of simulation II: sequential dynamical systems
Applied Mathematics and Computation
Discrete, sequential dynamical systems
Discrete Mathematics
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
Computational Complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
The Complexity of Counting in Sparse, Regular, and Planar Graphs
SIAM Journal on Computing
On Counting Fixed Point Configurations in Star Networks
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 8 - Volume 09
On computational complexity of counting fixed points in symmetric boolean graph automata
UC'05 Proceedings of the 4th international conference on Unconventional Computation
| Hi-index | 0.00 |
Modeling, designing and analyzing large scale multi-agent systems (MAS) with anywhere from tens of thousands to millions of autonomous agents will require mathematical and computational theories and models substantially different from those underlying the study of small- to medium-scale MAS made of only dozens, or perhaps hundreds, of agents. In this paper, we study certain aspects of the global behavior of large ensembles of simple reactive agents. We do so by analyzing the collective dynamics of several related models of discrete complex systems based on cellular automata. We survey our recent results on dynamical properties of the complex systems of interest, and discuss some useful ways forward in modeling and analysis of large-scale MAS via appropriately modified versions of the classical cellular automata.