Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
On classifications of fitness functions
Theoretical aspects of evolutionary computing
Crossover in Grammatical Evolution
Genetic Programming and Evolvable Machines
Proceedings of the European Conference on Genetic Programming
A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming
Evolutionary Computation
Representations for Genetic and Evolutionary Algorithms
Representations for Genetic and Evolutionary Algorithms
Fitness-proportional negative slope coefficient as a hardness measure for genetic algorithms
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Evolutionary Computation
Semantic Aware Crossover for Genetic Programming: The Case for Real-Valued Function Regression
EuroGP '09 Proceedings of the 12th European Conference on Genetic Programming
Sustaining diversity using behavioral information distance
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Limitations of the fitness-proportional negative slope coefficient as a difficulty measure
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Semantic analysis of program initialisation in genetic programming
Genetic Programming and Evolvable Machines
Semantically driven mutation in genetic programming
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
A comprehensive view of fitness landscapes with neutrality and fitness clouds
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Towards an understanding of locality in genetic programming
Proceedings of the 12th annual conference on Genetic and evolutionary computation
Linear Genetic Programming
On the locality of grammatical evolution
EuroGP'06 Proceedings of the 9th European conference on Genetic Programming
Phenotypic diversity in initial genetic programming populations
EuroGP'10 Proceedings of the 13th European conference on Genetic Programming
Predicting problem difficulty for genetic programming applied to data classification
Proceedings of the 13th annual conference on Genetic and evolutionary computation
How far is it from here to there? a distance that is coherent with GP operators
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
An empirical study of functional complexity as an indicator of overfitting in genetic programming
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
Estimating classifier performance with genetic programming
EuroGP'11 Proceedings of the 14th European conference on Genetic programming
An ecological approach to measuring locality in linear genotype to phenotype maps
EuroGP'12 Proceedings of the 15th European conference on Genetic Programming
| Hi-index | 0.00 |
The property that neighbouring genotypes tend to map to neighbouring phenotypes, i.e. locality, is an important criterion in the study of problem difficulty. Locality is problematic in tree-based genetic programming (GP), since typically there is no explicit phenotype. Here, we define multiple phenotypes for the artificial ant problem, and use them to describe a novel fine-grained view of GP locality. This allows us to identify the mapping from an ant's behavioural phenotype to its concrete path as being inherently non-local, and show that therefore alternative genetic encodings and operators cannot make the problem easy. We relate this to the results of evolutionary runs.