Evolving cellular automata to perform computations: mechanisms and impediments
Proceedings of the NATO advanced research workshop and EGS topical workshop on Chaotic advection, tracer dynamics and turbulent dispersion
Neutrality in fitness landscapes
Applied Mathematics and Computation
A new kind of science
Coevolutionary Learning: A Case Study
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
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
The Density of States - A Measure of the Difficulty of Optimisation Problems
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
Fitness landscapes and problem hardness in genetic programming
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Hi-index | 0.00 |
We study in detail the fitness landscape of a difficult cellular automata computational task: the majority problem Our results show why this problem landscape is so hard to search, and we quantify the large degree of neutrality found in various ways We show that a particular subspace of the solution space, called the ”Olympus”, is where good solutions concentrate, and give measures to quantitatively characterize this subspace.