Computer Science – Neural and Evolutionary Computing
Scientific paper
2012-03-22
Computer Science
Neural and Evolutionary Computing
A conference version has been accepted for GECCO 2012
Scientific paper
The computational complexity analysis of genetic programming (GP) has been started recently by analyzing simple (1+1) GP algorithms for the problems ORDER and MAJORITY. In this paper, we study how taking the complexity as an additional criteria influences the runtime behavior. We consider generalizations of ORDER and MAJORITY and present a computational complexity analysis of (1+1) GP using multi-criteria fitness functions that take into account the original objective and the complexity of a syntax tree as a secondary measure. Furthermore, we study the expected time until population-based multi-objective genetic programming algorithms have computed the Pareto front when taking the complexity of a syntax tree as an equally important objective.
No associations
LandOfFree
Computational Complexity Analysis of Multi-Objective Genetic Programming 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 Multi-Objective Genetic Programming, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computational Complexity Analysis of Multi-Objective Genetic Programming will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-381260