Genetic fitness optimization using rapidly mixing Markov chains

DOI10.1007/3-540-61863-5_35MaRDI QIDQ3556980zbMATH OpenOpenAlexFDO

Authors Paul M. B. Vitányi

Publication date 27 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/2171

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Recommendations

• A discipline of evolutionary programming
• Modeling genetic algorithms with Markov chains.
• Linear analysis of genetic algorithms
• First passage times of genetic algorithms
• Modeling the genetic algorithm by a nonhomogeneous Markov chain: weak and strong ergodicity

Cited in

(5)

• scientific article; zbMATH DE number 1439488 (Why is no real title available?)
• Markov chain analysis of genetic algorithms applied to fitness functions perturbed concurrently by additive and multiplicative noise
• scientific article; zbMATH DE number 2118220 (Why is no real title available?)
• An analytical contrast between fitness maximization and selection for mixability
• The Markov network fitness model

This page was built for publication: Genetic fitness optimization using rapidly mixing Markov chains

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3556980)