Genetic algorithms in random environments: two examples
From MaRDI portal
Branching processes (Galton-Watson, birth-and-death, etc.) (60J80) Applications of branching processes (60J85) Processes in random environments (60K37) 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)
Recommendations
Cites work
- A Metropolis-type optimization algorithm on the infinite tree
- Asymptotic convergence of genetic algorithms
- Biased random walks on Galton-Watson trees
- scientific article; zbMATH DE number 1381974 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1100794 (Why is no real title available?)
- scientific article; zbMATH DE number 1552333 (Why is no real title available?)
- scientific article; zbMATH DE number 897154 (Why is no real title available?)
- Large deviations for random walks on Galton-Watson trees: Averaging and uncertainty
- On the effect of selection in genetic algorithms
- Probability. Theory and examples.
- Techniques for bounding the convergence rate of genetic algorithms
- Tree-indexed processes
- Un principe d'invariance pour un algorithme génétique en population finie
Cited in
(3)
This page was built for publication: Genetic algorithms in random environments: two examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2570837)