Limits to Expression in Genetic Programming: Lattice-Aggregate Modeling

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

@InProceedings{daida:2002:lteigplm,

• author = "Jason M. Daida",
• title = "Limits to Expression in Genetic Programming: Lattice-Aggregate Modeling",
• booktitle = "Proceedings of the 2002 Congress on Evolutionary Computation CEC2002",
• editor = "David B. Fogel and Mohamed A. El-Sharkawi and Xin Yao and Garry Greenwood and Hitoshi Iba and Paul Marrow and Mark Shackleton",
• pages = "273--278",
• year = "2002",
• publisher = "IEEE Press",
• publisher_address = "445 Hoes Lane, P.O. Box 1331, Piscataway, NJ 08855-1331, USA",
• organisation = "IEEE Neural Network Council (NNC), Institution of Electrical Engineers (IEE), Evolutionary Programming Society (EPS)",
• ISBN = "0-7803-7278-6",
• month = "12-17 " # may,
• notes = "CEC 2002 - A joint meeting of the IEEE, the Evolutionary Programming Society, and the IEE. Held in connection with the World Congress on Computational Intelligence (WCCI 2002)",
• keywords = "genetic algorithms, genetic programming, GP search space, ballistic accretion, expression limits, four-region partition, genetic programming, lattice-aggregate modelling, shape evolution, size evolution, theoretical model, evolutionary computation, search problems",
• URL = "http://sitemaker.umich.edu/daida/files/CEC7272.pdf",
• DOI = "doi:10.1109/CEC.2002.1006246",
• abstract = "This paper describes a general theoretical model of size and shape evolution in genetic programming. The proposed model incorporates a mechanism that is analogous to ballistic accretion in physics. The model indicates a four-region partition of GP search space. It further suggests that two of these regions are not searchable by GP.",

}

Genetic Programming entries for Jason M Daida

Citations