Sciweavers

9 search results - page 1 / 2
» Asymptotical Convergence Rates of Simple Evolutionary Algori...
Sort
View
AE
1997
Springer
13 years 9 months ago
Asymptotical Convergence Rates of Simple Evolutionary Algorithms under Factorizing Mutation Distributions
Abstract. The standard choice for mutating an individual of an evolutionary algorithm with continuous variables is the normal distribution. It is shown that there is a broad class ...
Günter Rudolph
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
NIPS
2008
13 years 6 months ago
Linear Classification and Selective Sampling Under Low Noise Conditions
We provide a new analysis of an efficient margin-based algorithm for selective sampling in classification problems. Using the so-called Tsybakov low noise condition to parametrize...
Giovanni Cavallanti, Nicolò Cesa-Bianchi, C...
CEC
2009
IEEE
14 years 2 days ago
Differential Evolution with Laplace mutation operator
— Differential Evolution (DE) is a novel evolutionary approach capable of handling non-differentiable, non-linear and multi-modal objective functions. DE has been consistently ra...
Millie Pant, Radha Thangaraj, Ajith Abraham, Crina...
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