The evolution of evolvability in genetic programming
Advances in genetic programming
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
Correlation analysis of the synchronizing-CA landscape
Proceedings of the 16th annual international conference of the Center for Nonlinear Studies on Landscape paradigms in physics and biology : concepts, structures and dynamics: concepts, structures and dynamics
Neutrality in fitness landscapes
Applied Mathematics and Computation
A new kind of science
Time Series Analysis, Forecasting and Control
Time Series Analysis, Forecasting and Control
Coevolutionary Learning: A Case Study
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Evolving Globally Synchronized Cellular Automata
Proceedings of the 6th International Conference on Genetic Algorithms
Mechanisms of Emergent Computation in Cellular Automata
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Fitness Distance Correlation and Ridge Functions
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
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 '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Evolutionary Computation
GECCO '96 Proceedings of the 1st annual conference on Genetic and evolutionary computation
CrossNet: a framework for crossover with network-based chromosomal representations
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A Neuro-Genetic Framework for Pattern Recognition in Complex Systems
Fundamenta Informaticae - Membrane Computing
Application notes: MEBRA: multiobjective evolutionary-based risk assessment
IEEE Computational Intelligence Magazine
An overview of AI research in Italy
Artificial intelligence
Image processing using 3-state cellular automata
Computer Vision and Image Understanding
The road to VEGAS: guiding the search over neutral networks
Proceedings of the 13th annual conference on Genetic and evolutionary computation
NILS: a neutrality-based iterated local search and its application to flowshop scheduling
EvoCOP'11 Proceedings of the 11th European conference on Evolutionary computation in combinatorial optimization
On the neutrality of flowshop scheduling fitness landscapes
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
A Neuro-Genetic Framework for Pattern Recognition in Complex Systems
Fundamenta Informaticae - Membrane Computing
Hi-index | 5.23 |
In this paper we study cellular automata (CAs) that perform the computational Majority task. This task is a good example of what the phenomenon of emergence in complex systems is. We take an interest in the reasons that make this particular fitness landscape a difficult one. The first goal is to study the landscape as such, and thus it is ideally independent from the actual heuristics used to search the space. However, a second goal is to understand the features a good search technique for this particular problem space should possess. We statistically quantify in various ways the degree of difficulty of searching this landscape. Due to neutrality, investigations based on sampling techniques on the whole landscape are difficult to conduct. So, we go exploring the landscape from the top. Although it has been proved that no CA can perform the task perfectly, several efficient CAs for this task have been found. Exploiting similarities between these CAs and symmetries in the landscape, we define the Olympus landscape which is regarded as the ''heavenly home'' of the best local optima known (blok). Then we measure several properties of this subspace. Although it is easier to find relevant CAs in this subspace than in the overall landscape, there are structural reasons that prevent a searcher from finding overfitted CAs in the Olympus. Finally, we study dynamics and performance of genetic algorithms on the Olympus in order to confirm our analysis and to find efficient CAs for the Majority problem with low computational cost.