Computer Science – Neural and Evolutionary Computing
Scientific paper
2010-07-27
Computer Science
Neural and Evolutionary Computing
26 pages
Scientific paper
Analyzing the computational complexity of evolutionary algorithms for binary search spaces has significantly increased their theoretical understanding. With this paper, we start the computational complexity analysis of genetic programming. We set up several simplified genetic programming algorithms and analyze them on two separable model problems, ORDER and MAJORITY, each of which captures an important facet of typical genetic programming problems. Both analyses give first rigorous insights on aspects of genetic programming design, highlighting in particular the impact of accepting or rejecting neutral moves and the importance of a local mutation operator.
Durrett Greg
Neumann Frank
O'Reilly Una-May
No associations
LandOfFree
Computational Complexity Analysis of Simple Genetic Programming On Two Problems Modeling Isolated Program Semantics does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Computational Complexity Analysis of Simple Genetic Programming On Two Problems Modeling Isolated Program Semantics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational Complexity Analysis of Simple Genetic Programming On Two Problems Modeling Isolated Program Semantics will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-320533