Adaptation of Representation in Genetic Programming

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

@InProceedings{janikow:2003:ANNIE,

• author = "Cezary Z. Janikow and Rahul A Deshpande",
• title = "Adaptation of Representation in Genetic Programming",
• booktitle = "Smart Engineering System Design: Neural Networks, Fuzzy Logic, Evolutionary Programming, Complex Systems, and Artificial Life (ANNIE'2003)",
• editor = "Cihan H. Dagli and Anna L. Buczak and Joydeep Ghosh and Mark J. Embrechts and Okan Ersoy",
• pages = "45--50",
• publisher = "ASME Press",
• month = "2-5 " # nov,
• year = "2003",
• keywords = "genetic algorithms, genetic programming",
• URL = "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.585.5050",
• URL = "http://www.cs.umsl.edu/~janikow/publications/2003/Adaptation%20of%20Representation%20in%20Genetic%20Programming/ams2003.pdf",
• size = "6 pages",
• abstract = "This paper discusses our initial work on automatically adapting Genetic Programming (GP) representation. We present here two independent techniques: AMS and ACE. Both techniques are based on Constrained GP (CGP), which uses mutation set methodology to prune the representation space according to some context-specific constraints. The ASM technique monitors the performance of local context heuristics when used in mutation/crossover, during GP evolution, and dynamically modifies the heuristics. The ACE technique iterates complete CGP runs and then uses the distribution information from the best solutions to adjust the heuristics for the next iteration. As the results indicate, GP is able to gain substantial performance improvements as well as learn qualitative heuristics.",
• notes = "broken http://web.mst.edu/~annie/annie03_Final/welcome.htm",

}

Genetic Programming entries for Cezary Z Janikow Rahul A Deshpande

Citations