Sciweavers

2152 search results - page 365 / 431
» Backward-chaining evolutionary algorithms
Sort
View
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
15 years 1 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
2010
Springer
141views Optimization» more  GECCO 2010»
15 years 1 months ago
Today/future importance analysis
SBSE techniques have been widely applied to requirements selection and prioritization problems in order to ascertain a suitable set of requirements for the next release of a syste...
Yuanyuan Zhang, Enrique Alba, Juan J. Durillo, Sig...
GECCO
2008
Springer
129views Optimization» more  GECCO 2008»
14 years 11 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
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
14 years 11 months ago
Potential fitness for genetic programming
We introduce potential fitness, a variant of fitness function that operates in the space of schemata and is applicable to tree-based genetic programing. The proposed evaluation ...
Krzysztof Krawiec, PrzemysBaw Polewski
TEC
2008
165views more  TEC 2008»
14 years 9 months ago
Population-Based Incremental Learning With Associative Memory for Dynamic Environments
In recent years, interest in studying evolutionary algorithms (EAs) for dynamic optimization problems (DOPs) has grown due to its importance in real-world applications. Several app...
Shengxiang Yang, Xin Yao