The dynamics of mutation-selection algorithms with large population sizes
From MaRDI portal
Recommendations
Cited in
(16)- Geometric convergence of genetic algorithms under tempered random restart
- THE DYNAMICS OF A CHANGING RANGE GENETIC ALGORITHM UNDER STABILIZING SELECTION
- A Markov chain analysis of genetic algorithms: large deviation principle approach
- Dynamiques recuites de type Feynman-Kac : résultats précis et conjectures
- Global optimization with exploration/selection algorithms and simulated annealing
- Sharp asymptotic results for simplified mutation-selection algorithms
- A new genetic algorithm specifically based on mutation and selection
- Mutation-selection algorithm: A large deviation approach
- scientific article; zbMATH DE number 1552335 (Why is no real title available?)
- A new genetic algorithm
- The exit path of a Markov chain with rare transitions
- A weighted random walk model, with application to a genetic algorithm
- Error thresholds in a mutation-selection model with Hopfield-type fitness
- Markovian perturbations of discrete iterations: Lyapunov functions, global minimization, and associative memory
- Selection for mutational robustness in finite populations
- Asymptotic Hitting Time for a Simple Evolutionary Model of Protein Folding
This page was built for publication: The dynamics of mutation-selection algorithms with large population sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1920459)