Sciweavers

229 search results - page 28 / 46
» Potential fitness for genetic programming
Sort
View
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
13 years 8 months ago
Using quotient graphs to model neutrality in evolutionary search
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
Dominic Wilson, Devinder Kaur
CEC
2009
IEEE
13 years 5 months ago
Analysis of constant creation techniques on the binomial-3 problem with grammatical evolution
This paper studies the difference between Persistent Random Constants (PRC) and Digit Concatenation as methods for generating constants. It has been shown that certain problems hav...
Jonathan Byrne, Michael O'Neill, Erik Hemberg, Ant...
PPSN
1994
Springer
13 years 11 months ago
An Evolutionary Algorithm for Integer Programming
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
Günter Rudolph
PRL
2006
139views more  PRL 2006»
13 years 7 months ago
Evolving color constancy
Objects retain their color in spite of changes in the wavelength and energy composition of the light they reflect. This phenomenon is called color constancy and plays an important ...
Marc Ebner
GECCO
2010
Springer
186views Optimization» more  GECCO 2010»
13 years 8 months ago
Genetic rule extraction optimizing brier score
Most highly accurate predictive modeling techniques produce opaque models. When comprehensible models are required, rule extraction is sometimes used to generate a transparent mod...
Ulf Johansson, Rikard König, Lars Niklasson