Skip to main content

Automated Problem Decomposition for the Boolean Domain with Genetic Programming

Otero, Fernando E.B., Johnson, Colin G. (2013) Automated Problem Decomposition for the Boolean Domain with Genetic Programming. In: 16th European Conference on Genetic Programming (EuroGP 2013). Lecture Notes in Computer Science . pp. 169-180. Springer ISBN 978-3-642-37206-3. E-ISBN 978-3-642-37207-0. (doi:10.1007/978-3-642-37207-0_15)

PDF - Author's Accepted Manuscript
Download (200kB) Preview
[img]
Preview
Official URL
http://dx.doi.org/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 subproblems and combine the individual solutions into the complete solution to the problem.

Item Type: Conference or workshop item (Paper)
DOI/Identification number: 10.1007/978-3-642-37207-0_15
Subjects: Q Science > Q Science (General) > Q335 Artificial intelligence
Divisions: Faculties > Sciences > School of Computing > Computational Intelligence Group
Faculties > Sciences > School of Computing > Data Science
Depositing User: Fernando Otero
Date Deposited: 07 Aug 2014 18:49 UTC
Last Modified: 01 Aug 2019 10:37 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/42138 (The current URI for this page, for reference purposes)
Otero, Fernando E.B.: https://orcid.org/0000-0003-2172-297X
Johnson, Colin G.: https://orcid.org/0000-0002-9236-6581
  • Depositors only (login required):

Downloads

Downloads per month over past year