Genetic programming: on the programming of computers by means of natural selection
Genetic programming: on the programming of computers by means of natural selection
Genetic programming II: automatic discovery of reusable programs
Genetic programming II: automatic discovery of reusable programs
Genetic Programming III: Darwinian Invention & Problem Solving
Genetic Programming III: Darwinian Invention & Problem Solving
Evolving Modules in Genetic Programming by Subtree Encapsulation
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Solving the artificial ant on the Santa Fe trail problem in 20,696 fitness evaluations
Proceedings of the 9th annual conference on Genetic and evolutionary computation
A grammatical genetic programming approach to modularity in genetic algorithms
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Layered learning in boolean GP problems
EuroGP'07 Proceedings of the 10th European conference on Genetic programming
Open issues in genetic programming
Genetic Programming and Evolvable Machines
A non-destructive grammar modification approach to modularity in grammatical evolution
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Tag-based modules in genetic programming
Proceedings of the 13th annual conference on Genetic and evolutionary computation
The Automatic Acquisition, Evolution and Reuse of Modules in Cartesian Genetic Programming
IEEE Transactions on Evolutionary Computation
EpochX: genetic programming in java with statistics and event monitoring
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Geometric semantic genetic programming
PPSN'12 Proceedings of the 12th international conference on Parallel Problem Solving from Nature - Volume Part I
Event-based graphical monitoring in the EpochX genetic programming framework
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
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.