Algorithms (X, sigma, eta): Quasi-random Mutations for Evolution Strategies
Authors:
- 1 January 2006
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 296-307
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Convergence results for the -SA-ES using the theory of -irreducible Markov chainsTheoretical Computer Science, 2005
- On the analysis of the (1+1) evolutionary algorithmTheoretical Computer Science, 2002
- Completely Derandomized Self-Adaptation in Evolution StrategiesEvolutionary Computation, 2001
- The Theory of Evolution Strategies2001
- Rigorous Hitting Times for Binary MutationsEvolutionary Computation, 1999
- Wavelets, Vibrations and Scalings1997
- An asymptotic theory for genetic algorithmsLecture Notes in Computer Science, 1996
- Number-theoretic Methods in Statistics1994
- Random Number Generation and Quasi-Monte Carlo Methods1992
- Maximization by Quadratic Hill-ClimbingEconometrica, 1966