Modularization by Multi-Run Frequency Driven Subtree Encapsulation

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

@InCollection{howard:2003:GPTP,

• author = "Daniel Howard",
• title = "Modularization by Multi-Run Frequency Driven Subtree Encapsulation",
• booktitle = "Genetic Programming Theory and Practice",
• publisher = "Kluwer",
• year = "2003",
• editor = "Rick L. Riolo and Bill Worzel",
• chapter = "10",
• pages = "155--171",
• keywords = "genetic algorithms, genetic programming, Modularization, Subtree Encapsulation, Multi-run, ADF, Subtree Database, Subtree Frequency, Parity Problem",
• ISBN = "1-4020-7581-2",
• URL = "http://www.springer.com/computer/ai/book/978-1-4020-7581-0",
• DOI = "doi:10.1007/978-1-4419-8983-3_10",
• abstract = "In tree-based Genetic Programming, subtrees which represent potentially useful sub-solutions can be encapsulated in order to protect them and aid their proliferation throughout the population. This paper investigates implementing this as a multi-run method. A two-stage encapsulation scheme based on subtree survival and frequency is compared against Automatically Defined Functions in fixed and evolved architectures and standard Genetic Programming for solving a Parity problem.",
• notes = "Part of \cite{RioloWorzel:2003}",
• size = "18 pages",

}

Genetic Programming entries for Daniel Howard

Citations