Forrest Sondahl
William Rand
ABSTRACT
We used a genetic algorithm to evaluate the cost / benefit of diversity in evolving sets of rules for non-uniform cellular automata solving the density classification problem.
- Gacs, P., Kurdyumov, G. L., and Levin, L. A. One dimensional uniform arrays that wash out finite islands. Problemy Peredachi Informatsii 14 (1978), 92--98.Google Scholar
- Mitchell, M., Crutchfield, J. P., and Das, R. Evolving cellular automata with genetic algorithms: A review of recent work. In Proceedings of the First International Conference on Evolutionary Computation and Its Applications (Moscow, Russia, 1996), Russian Academy of Sciences.Google Scholar
- Sipper, M. Evolution of Parallel Cellular Machines: The Cellular Programming Approach. Springer-Verlag, Heidelberg, 1997. Google ScholarDigital Library
Index Terms
- Evolution of non-uniform cellular automata using a genetic algorithm: diversity and computation
Recommendations
Non-uniform cellular automata: Classes, dynamics, and decidability
The dynamical behavior of non-uniform cellular automata is compared with the one of classical cellular automata. Several differences and similarities are pointed out by a series of examples. Decidability of basic properties like surjectivity and ...
Non-uniform number-conserving elementary cellular automata
AbstractIn this paper, we investigate non-uniform elementary cellular automata (i.e., one-dimensional cellular automata whose cells can use different Wolfram rules to update their states) in the context of number conservation. As a result, we ...
Analysis of a triploid genetic algorithm over deceptive landscapes
SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied ComputingThis paper compares the performance of a canonical genetic algorithm (CGA) against that of the triploid genetic algorithm (TGA) introduced in [10], over a number of well known deceptive landscapes in order to increase our understanding of the TGA's ...
Comments