Evolving Globally Synchronized Cellular Automata
Proceedings of the 6th International Conference on Genetic Algorithms
A Genetic Algorithm Discovers Particle-Based Computation in Cellular Automata
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
| Hi-index | 0.00 |
The density classification problem has long been recognized as a benchmark for exploring cellular automata rules with global properties. One of the major difficulties in evaluating rules is the enormous number of configurations which have to be tested, particularly important in any search process. We consider an approach to rule evaluation, which is in some ways the reverse of the standard methods, and discuss problems and opportunities raised by the approach.