- author = "Terry {Van Belle} and David H. Ackley",
- title = "Code Factoring And The Evolution Of Evolvability",
- booktitle = "GECCO 2002: Proceedings of the Genetic and Evolutionary Computation Conference",
- editor = "W. B. Langdon and E. Cant{\'u}-Paz and K. Mathias and R. Roy and D. Davis and R. Poli and K. Balakrishnan and V. Honavar and G. Rudolph and J. Wegener and L. Bull and M. A. Potter and A. C. Schultz and J. F. Miller and E. Burke and N. Jonoska",
- year = "2002",
- pages = "1383--1390",
- address = "New York",
- publisher_address = "San Francisco, CA 94104, USA",
- month = "9-13 " # jul,
- publisher = "Morgan Kaufmann Publishers",
- keywords = "genetic algorithms, genetic programming, search-based software engineering, automatically defined functions, code factoring, dynamic environment, evolution of evolvability, software engineering",
- ISBN = "1-55860-878-8",
-
URL = "
http://gpbib.cs.ucl.ac.uk/gecco2002/SBSE170.ps",
-
URL = "
http://gpbib.cs.ucl.ac.uk/gecco2002/SBSE170.pdf",
-
URL = "http://www.cs.ucl.ac.uk/staff/W.Langdon/ftp/papers/gecco2002/gecco-2002-25.pdf",
-
notes = "GECCO-2002. A joint meeting of the eleventh
International Conference on Genetic Algorithms
(ICGA-2002) and the seventh Annual Genetic Programming
Conference (GP-2002)
Wed, 28 Jan 2004 17:06:27 MST genetic_programming@yahoogroups.com Actually, the experiments in our GECCO 2002 paper _did_ use the standard tree depth < 17 cutoff on both branches, which is a form of parsimony pressure. This should have been reported, but unfortunately wasn't :-( Even though the typical RPBs generated were much shallower than the cutoff, it could have affected the RPB evolution, and probably helped keep down the ADF sizes somewhat.
Lilgp",
