Locality in Continuous Fitness-Valued Cases and Genetic Programming Difficulty
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 41-56
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation RatesIEEE Transactions on Evolutionary Computation, 2012
- Defining locality as a problem difficulty measure in genetic programmingGenetic Programming and Evolvable Machines, 2011
- Neutrality in evolutionary algorithms… What do we know?Evolving Systems, 2011
- Towards an understanding of locality in genetic programming2010
- Defining locality in genetic programming to predict performance2010
- An Empirical Investigation of How Degree Neutrality Affects GP SearchLecture Notes in Computer Science, 2009
- A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic ProgrammingEvolutionary Computation, 2005
- Landscapes and Effective Fitness2003
- Evolution strategies – A comprehensive introductionNatural Computing, 2002
- A comparison of predictive measures of problem difficulty in evolutionary algorithmsIEEE Transactions on Evolutionary Computation, 2000