Sciweavers

203 search results - page 30 / 41
» Fitness landscapes and problem hardness in evolutionary comp...
Sort
View
GECCO
2011
Springer
232views Optimization» more  GECCO 2011»
14 years 3 months ago
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis
When the epistasis of the fitness function is bounded by a constant, we show that the expected fitness of an offspring of the (1+1)-EA can be efficiently computed for any point...
Andrew M. Sutton, Darrell Whitley, Adele E. Howe
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 6 months ago
Self-adaptive simulated binary crossover for real-parameter optimization
Simulated binary crossover (SBX) is a real-parameter recombination operator which is commonly used in the evolutionary algorithm (EA) literature. The operator involves a parameter...
Kalyanmoy Deb, Karthik Sindhya, Tatsuya Okabe
GECCO
2007
Springer
135views Optimization» more  GECCO 2007»
15 years 6 months ago
A cumulative evidential stopping criterion for multiobjective optimization evolutionary algorithms
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...
Luis Martí, Jesús García, Ant...
BMCBI
2006
143views more  BMCBI 2006»
14 years 11 months ago
Fast estimation of the difference between two PAM/JTT evolutionary distances in triplets of homologous sequences
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
Christophe Dessimoz, Manuel Gil, Adrian Schneider,...
NICSO
2010
Springer
15 years 3 months ago
Accelerated Genetic Algorithms with Markov Chains
t] Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for comple...
Guan Wang, Chen Chen, Kwok Yip Szeto