Sciweavers

146 search results - page 4 / 30
» A Comparison of Bloat Control Methods for Genetic Programmin...
Sort
View
CEC
2005
IEEE
14 years 16 days ago
Single parent genetic programming
The most controversial part of genetic programming is its highly disruptive and potentially innovative subtree crossover operator. The clearest problem with the crossover operator...
Wendy Ashlock, Dan Ashlock
CPHYSICS
2006
204views more  CPHYSICS 2006»
13 years 7 months ago
Genetically controlled random search: a global optimization method for continuous multidimensional functions
A new stochastic method for locating the global minimum of a multidimensional function inside a rectangular hyperbox is presented. A sampling technique is employed that makes use ...
Ioannis G. Tsoulos, Isaac E. Lagaris
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
GECCO
2007
Springer
166views Optimization» more  GECCO 2007»
14 years 1 months ago
Comparison of tree and graph encodings as function of problem complexity
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...
Michael D. Schmidt, Hod Lipson
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
13 years 10 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley