Genetic fitness optimization using rapidly mixing Markov chains

DOI10.1007/3-540-61863-5_35zbMATH Open1184.68430OpenAlexW1596749826MaRDI QIDQ3556980FDOQ3556980

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

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

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)

Cited In (5)

• Title not available (Why is that?)
• Markov chain analysis of genetic algorithms applied to fitness functions perturbed concurrently by additive and multiplicative noise
• Title not available (Why is that?)
• 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)