Reducing bias and inefficiency in the selection algorithm
Proceedings of the Second International Conference on Genetic Algorithms on Genetic algorithms and their application
Proceedings of the third international conference on Genetic algorithms
`` Direct Search'' Solution of Numerical and Statistical Problems
Journal of the ACM (JACM)
Lectures on Discrete Geometry
Evolution strategies –A comprehensive introduction
Natural Computing: an international journal
Not all linear functions are equally difficult for the compact genetic algorithm
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Rigorous runtime analysis of a (μ+1)ES for the sphere function
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Convergence results for the (1, λ)-SA-ES using the theory of ϕ-irreducible Markov chains
Theoretical Computer Science
Completely Derandomized Self-Adaptation in Evolution Strategies
Evolutionary Computation
Comparison-based algorithms are robust and randomized algorithms are anytime
Evolutionary Computation
Toward a theory of evolution strategies: On the benefits of sex---the (μ/μ, λ) theory
Evolutionary Computation
General lower bounds for evolutionary algorithms
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Optimal weighted recombination
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
On the Parallel Speed-Up of Estimation of Multivariate Normal Algorithm and Evolution Strategies
EvoWorkshops '09 Proceedings of the EvoWorkshops 2009 on Applications of Evolutionary Computing: EvoCOMNET, EvoENVIRONMENT, EvoFIN, EvoGAMES, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, EvoNUM, EvoSTOC, EvoTRANSLOG
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Log(λ) modifications for optimal parallelism
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Comparison-based complexity of multiobjective optimization
Proceedings of the 13th annual conference on Genetic and evolutionary computation
A new selection ratio for large population sizes
EvoApplicatons'10 Proceedings of the 2010 international conference on Applications of Evolutionary Computation - Volume Part I
| Hi-index | 0.00 |
We derive lower bounds for comparison-based or selection-based algorithms, improving existing results in the continuous setting, and extending them to non-trivial results in the discrete case. This is achieved by considering the VC-dimension of the level sets of the fitness functions; results are then obtained through the use of Sauer's lemma. In the special case of optimization of the sphere function, improved lower bounds are obtained by bounding the possible number of sign conditions realized by some systems of equations.