%0 Conference Paper %1 langdon:2003:gecco %A Langdon, W. B. %B Genetic and Evolutionary Computation -- GECCO-2003 %C Chicago %D 2003 %E Cantú-Paz, E. %E Foster, J. A. %E Deb, K. %E Davis, D. %E Roy, R. %E O'Reilly, U.-M. %E Beyer, H.-G. %E Standish, R. %E Kendall, G. %E Wilson, S. %E Harman, M. %E Wegener, J. %E Dasgupta, D. %E Potter, M. A. %E Schultz, A. C. %E Dowsland, K. %E Jonoska, N. %E Miller, J. %I Springer-Verlag %K Neighborhood, algorithms, amorphous average bit boolean climbing, computer computer, computing, expected fitness flip function, general genetic hill landscapes, linear map, modulo mutation, point programming programming, proof, random reversible route runtime, %P 1702--1714 %T Convergence of Program Fitness Landscapes %U http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_gecco2003.ps.gz %V 2724 %X 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. %@ 3-540-40603-4

@inproceedings{langdon:2003:gecco, 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.}, added-at = {2008-06-19T17:35:00.000+0200}, address = {Chicago}, author = {Langdon, W. B.}, biburl = {https://www.bibsonomy.org/bibtex/25791619a751e5a3cac5b6fe6483429df/brazovayeye}, booktitle = {Genetic and Evolutionary Computation -- GECCO-2003}, editor = {Cant{\'u}-Paz, E. and Foster, J. A. and Deb, K. and Davis, D. and Roy, R. and O'Reilly, U.-M. and Beyer, H.-G. and Standish, R. and Kendall, G. and Wilson, S. and Harman, M. and Wegener, J. and Dasgupta, D. and Potter, M. A. and Schultz, A. C. and Dowsland, K. and Jonoska, N. and Miller, J.}, interhash = {b413e4bb19c8aca948e7efb9189b3b41}, intrahash = {5791619a751e5a3cac5b6fe6483429df}, isbn = {3-540-40603-4}, keywords = {Neighborhood, algorithms, amorphous average bit boolean climbing, computer computer, computing, expected fitness flip function, general genetic hill landscapes, linear map, modulo mutation, point programming programming, proof, random reversible route runtime,}, month = {12-16 July}, 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)}, pages = {1702--1714}, publisher = {Springer-Verlag}, publisher_address = {Berlin}, series = {LNCS}, size = {12 pages}, timestamp = {2008-06-19T17:45:01.000+0200}, title = {Convergence of Program Fitness Landscapes}, url = {http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/wbl_gecco2003.ps.gz}, volume = 2724, year = 2003 }