Generality Versus Size in Genetic Programming

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

@InProceedings{rosca:1996:gVsGP,

• author = "Justinian Rosca",
• title = "Generality Versus Size in Genetic Programming",
• booktitle = "Genetic Programming 1996: Proceedings of the First Annual Conference",
• editor = "John R. Koza and David E. Goldberg and David B. Fogel and Rick L. Riolo",
• year = "1996",
• month = "28--31 " # jul,
• keywords = "genetic algorithms, genetic programming",
• pages = "381--387",
• address = "Stanford University, CA, USA",
• publisher = "MIT Press",
• URL = "ftp://ftp.cs.rochester.edu/pub/u/rosca/gp/96.gp.ps.gz",
• URL = "http://cognet.mit.edu/sites/default/files/books/9780262315876/pdfs/9780262315876_chap52.pdf",
• URL = "http://cognet.mit.edu/library/books/view?isbn=0262611279",
• size = "6 pages",
• abstract = "Genetic Programming (GP) uses variable size representations as programs. Size becomes an important and interesting emergent property of the structures evolved by GP. The size of programs can be both a controlling and a controlled factor in GP search. Size influences the efficiency of the search process and is related to the generality of solutions. This paper analyzes the size and generality issues in standard GP and GP using subroutines and addresses the question whether such an analysis can help control the search process. We relate the size, generalization and modularity issues for programs evolved to control an agent in a dynamic and non-deterministic environment, as exemplified by the Pac-Man game.",
• notes = "GP-96",

}

Genetic Programming entries for Justinian Rosca

Citations