Sciweavers

669 search results - page 120 / 134
» An evolutionary method for complex-process optimization
Sort
View
GECCO
2006
Springer
205views Optimization» more  GECCO 2006»
15 years 4 months ago
Bounding XCS's parameters for unbalanced datasets
This paper analyzes the behavior of the XCS classifier system on imbalanced datasets. We show that XCS with standard parameter settings is quite robust to considerable class imbal...
Albert Orriols-Puig, Ester Bernadó-Mansilla
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
15 years 4 months ago
A survey of mutation techniques in genetic programming
The importance of mutation varies across evolutionary computation domains including: genetic programming, evolution strategies, and genetic algorithms. In the genetic programming ...
Alan Piszcz, Terence Soule
GECCO
2006
Springer
167views Optimization» more  GECCO 2006»
15 years 4 months ago
Estimating the destructiveness of crossover on binary tree representations
In some cases, evolutionary algorithms represent individuals as typical binary trees with n leaves and n-1 internal nodes. When designing a crossover operator for a particular rep...
Luke Sheneman, James A. Foster
GECCO
2008
Springer
171views Optimization» more  GECCO 2008»
15 years 1 months ago
An EDA based on local markov property and gibbs sampling
The key ideas behind most of the recently proposed Markov networks based EDAs were to factorise the joint probability distribution in terms of the cliques in the undirected graph....
Siddhartha Shakya, Roberto Santana
98
Voted
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
15 years 1 months ago
Exploiting the path of least resistance in evolution
Hereditary Repulsion (HR) is a selection method coupled with a fitness constraint that substantially improves the performance and consistency of evolutionary algorithms. This als...
Gearoid Murphy, Conor Ryan