Loading...
Please wait, while we are loading the content...
Similar Documents
Automated problem decomposition for the boolean domain with genetic programming.
| Content Provider | CiteSeerX |
|---|---|
| Author | Otero, O. E. B. Johnson, Colin G. |
| Abstract | 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. 1 |
| File Format | |
| Access Restriction | Open |
| Subject Keyword | Boolean Domain Problem Decomposition Original Problem Genetic Programming Main Motivation Code Reuse Individual Solution Problem Decomposition Strategy Gp Search Previous Work Problem Space Complete Solution Complex Problem |
| Content Type | Text |
| Resource Type | Article |
