Genetic algorithms in random environments: two examples

DOI10.1007/S00440-004-0419-YzbMath1159.60354OpenAlexW2172285071MaRDI QIDQ2570837

Jean Bérard

Publication date: 28 October 2005

Published in: Probability Theory and Related Fields (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00440-004-0419-y

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59) Neural networks for/in biological studies, artificial life and related topics (92B20) Applications of branching processes (60J85) Processes in random environments (60K37) Branching processes (Galton-Watson, birth-and-death, etc.) (60J80)

Related Items (1)

The quasispecies regime for the simple genetic algorithm with ranking selection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Metropolis-type optimization algorithm on the infinite tree
• Tree-indexed processes
• Large deviations for random walks on Galton-Watson trees: Averaging and uncertainty
• Biased random walks on Galton-Watson trees
• Asymptotic convergence of genetic algorithms
• Techniques for bounding the convergence rate of genetic algorithms
• Un principe d'invariance pour un algorithme génétique en population finie
• Probability

This page was built for publication: Genetic algorithms in random environments: two examples