Automated Problem Decomposition for the Boolean Domain with Genetic Programming

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

@InProceedings{otero:2013:EuroGP,

• author = "Fernando E. B. Otero and Colin G. Johnson",
• title = "Automated Problem Decomposition for the Boolean Domain with Genetic Programming",
• booktitle = "Proceedings of the 16th European Conference on Genetic Programming, EuroGP 2013",
• year = "2013",
• month = "3-5 " # apr,
• editor = "Krzysztof Krawiec and Alberto Moraglio and Ting Hu and A. Sima Uyar and Bin Hu",
• series = "LNCS",
• volume = "7831",
• publisher = "Springer Verlag",
• address = "Vienna, Austria",
• pages = "169--180",
• organisation = "EvoStar",
• keywords = "genetic algorithms, genetic programming",
• isbn13 = "978-3-642-37206-3",
• DOI = "doi:10.1007/978-3-642-37207-0_15",
• abstract = "Researchers have been interested in exploring the regularities and modularity of the problem space in genetic programming (GP) with the aim of decomposing the original problem into several smaller subproblems. The main motivation is to allow GP to deal with more complex problems. Most previous works on modularity in GP emphasise the structure of modules used to encapsulate code and/or promote code reuse, instead of in the decomposition of the original problem. In this paper we propose a problem decomposition strategy that allows the use of a GP search to find solutions for sub-problems and combine the individual solutions into the complete solution to the problem.",
• notes = "Part of \cite{Krawiec:2013:GP} EuroGP'2013 held in conjunction with EvoCOP2013, EvoBIO2013, EvoMusArt2013 and EvoApplications2013",

}

Genetic Programming entries for Fernando Esteban Barril Otero Colin G Johnson

Citations