Backward-chaining evolutionary algorithms

DOI10.1016/J.ARTINT.2006.04.003zbMath1131.68507OpenAlexW2144942212WikidataQ58475682 ScholiaQ58475682MaRDI QIDQ2457607

William B. Langdon, Riccardo Poli

Publication date: 23 October 2007

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2006.04.003

zbMATH Keywords

genetic algorithmevolutionary computationgenetic programmingbackward chainingefficient searchtournament selection

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)

Uses Software

• Genocop

Cites Work

• Towards an analytic framework for analysing the computation time of evolutionary algorithms
• Modeling genetic algorithms with Markov chains.
• Foundations of Genetic Algorithms
• Drift analysis and average time complexity of evolutionary algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Backward-chaining evolutionary algorithms