Convergence of Program Fitness Landscapes

Created by W.Langdon from gp-bibliography.bib Revision:1.8178

@InProceedings{langdon:2003:gecco,

• author = "W. B. Langdon",
• title = "Convergence of Program Fitness Landscapes",
• booktitle = "Genetic and Evolutionary Computation -- GECCO-2003",
• editor = "E. Cant{\'u}-Paz and J. A. Foster and K. Deb and D. Davis and R. Roy and U.-M. O'Reilly and H.-G. Beyer and R. Standish and G. Kendall and S. Wilson and M. Harman and J. Wegener and D. Dasgupta and M. A. Potter and A. C. Schultz and K. Dowsland and N. Jonoska and J. Miller",
• year = "2003",
• pages = "1702--1714",
• address = "Chicago",
• publisher_address = "Berlin",
• month = "12-16 " # jul,
• volume = "2724",
• series = "LNCS",
• ISBN = "3-540-40603-4",
• publisher = "Springer-Verlag",
• keywords = "genetic algorithms, genetic programming, fitness landscapes, route map, expected runtime, reversible computer, random computer, amorphous computing, point mutation, Neighborhood, hill climbing, modulo computing, bit flip computer, general proof, boolean function, linear genetic programming, average computer",
• URL = "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_gecco2003.pdf",
• URL = "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_gecco2003.ps.gz",
• DOI = "doi:10.1007/3-540-45110-2_63",
• size = "12 pages",
• 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.",
• notes = "GECCO-2003 A joint meeting of the twelvth international conference on genetic algorithms (ICGA-99) and the eigth annual genetic programming conference (GP-2003)",

}

Genetic Programming entries for William B Langdon

Citations