Sciweavers

50 search results - page 5 / 10
» Quadratic Bloat in Genetic Programming
Sort
View
GECCO
2008
Springer
130views Optimization» more  GECCO 2008»
13 years 8 months ago
Parsimony pressure made easy
The parsimony pressure method is perhaps the simplest and most frequently used method to control bloat in genetic programming. In this paper we first reconsider the size evolutio...
Riccardo Poli, Nicholas Freitag McPhee
EC
1998
121views ECommerce» more  EC 1998»
13 years 6 months ago
Effects of Code Growth and Parsimony Pressure on Populations in Genetic Programming
Parsimony pressure, the explicit penalization of larger programs, has been increasingly used as a means of controlling code growth in genetic programming. However, in many cases p...
Terence Soule, James A. Foster
EUROGP
2003
Springer
119views Optimization» more  EUROGP 2003»
14 years 7 days ago
Maximum Homologous Crossover for Linear Genetic Programming
We introduce a new recombination operator, the Maximum Homologous Crossover for Linear Genetic Programming. In contrast to standard crossover, it attempts to preserve similar struc...
Michael Defoin-Platel, Manuel Clergue, Philippe Co...
EUROGP
2005
Springer
114views Optimization» more  EUROGP 2005»
14 years 17 days ago
Repeated Patterns in Tree Genetic Programming
We extend our analysis of repetitive patterns found in genetic programming genomes to tree based GP. As in linear GP, repetitive patterns are present in large numbers. Size fair cr...
William B. Langdon, Wolfgang Banzhaf
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
13 years 10 months ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang