A branching process model for genetic algorithms

DOI10.1016/0020-0190(95)00113-XzbMath0875.68461OpenAlexW2045770765MaRDI QIDQ1352099

Uday Kumar Chakraborty

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00113-x

zbMATH Keywords

AlgorithmsGenetic algorithmsSchemaBranching processSchema processingTakeover time

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Uses Software

• Genocop

Cites Work

• Using reliability analysis to estimate the number of generations to convergence in genetic algorithms
• Generalizing the notion of schema in genetic algorithms
• The algebra of genetic algorithms
• Table for Estimating the Goodness of Fit of Empirical Distributions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A branching process model for genetic algorithms