Abstract
Point mutation has no effect on almost all linear programs. In two genetic programming (GP) computers (cyclic and bit flip) we calculate the fitness evaluations needed-using steepest ascent and first ascent hill climbers and evolutionary search. We describe how the average fitness landscape scales with program length and give general bounds. © Springer-Verlag Berlin Heidelberg 2003.
Cite
CITATION STYLE
APA
Langdon, W. B. (2003). Convergence of program fitness landscapes. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2724, 1702–1714. https://doi.org/10.1007/3-540-45110-2_63
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free