Sciweavers

36 search results - page 2 / 8
» Self-adaptation of mutation distribution in evolutionary alg...
Sort
View
CEC
2007
IEEE
13 years 11 months ago
Self-adaptation of mutation distribution in evolutionary algorithms
— This paper proposes a self-adaptation method to control not only the mutation strength parameter, but also the mutation distribution for evolutionary algorithms. For this purpo...
Renato Tinós, Shengxiang Yang
PPSN
2010
Springer
13 years 3 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
GECCO
2006
Springer
207views Optimization» more  GECCO 2006»
13 years 9 months ago
Both robust computation and mutation operation in dynamic evolutionary algorithm are based on orthogonal design
A robust dynamic evolutionary algorithm (labeled RODEA), where both the robust calculation and mutation operator are based on an orthogonal design, is proposed in this paper. Prev...
Sanyou Y. Zeng, Rui Wang, Hui Shi, Guang Chen, Hug...
TEC
2012
195views Formal Methods» more  TEC 2012»
11 years 7 months ago
The Effects of Constant and Bit-Wise Neutrality on Problem Hardness, Fitness Distance Correlation and Phenotypic Mutation Rates
Kimura’s neutral theory of evolution has inspired researchers from the evolutionary computation community to incorporate neutrality into Evolutionary Algorithms (EAs) in the hop...
Riccardo Poli, Edgar Galván López
ICALP
2003
Springer
13 years 10 months ago
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
Although evolutionary algorithms (EAs) are widely used in practical optimization, their theoretical analysis is still in its infancy. Up to now results on the (expected) runtime ar...
Jens Jägersküpper