A discipline of evolutionary programming

DOI10.1016/S0304-3975(99)00263-7zbMath0944.68009MaRDI QIDQ1575454

Paul M. B. Vitányi

Publication date: 21 August 2000

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

genetic fitness optimization

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (3)

A fast quartet tree heuristic for hierarchical clustering ⋮ A stopping criterion for logarithmic simulated annealing ⋮ Hitting times of local and global optima in genetic algorithms with very high selection pressure

Cites Work

• Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
• Geometric bounds for eigenvalues of Markov chains
• What do we know about the Metropolis algorithm?
• Modeling genetic algorithms with Markov chains.
• Discrete probability and algorithms. Proceedings of the workshops ``Probability and algorithms and ``The finite Markov chain renaissance held at IMA, University of Minnesota, Minneapolis, MN, USA, 1993
• Approximating the Permanent
• Equation of State Calculations by Fast Computing Machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A discipline of evolutionary programming