Maximum homologous crossover for linear genetic programming

DOI10.1007/3-540-36599-0_18MaRDI QIDQ4418477zbMATH OpenFDO

Authors Michael Defoin-Platel, Manuel Clergue, Philippe Collard

Publication date 10 August 2003

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

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2610/26100194.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• scientific article; zbMATH DE number 1887345
• scientific article; zbMATH DE number 1872150
• Linear-tree GP and its comparison with other GP structures
• scientific article; zbMATH DE number 1887346
• scientific article; zbMATH DE number 890674

Cited in

(4)

• The Max problem revisited: the importance of mutation in genetic programming
• Linear Genetic Programming
• scientific article; zbMATH DE number 1872150 (Why is no real title available?)
• scientific article; zbMATH DE number 1887345 (Why is no real title available?)

This page was built for publication: Maximum homologous crossover for linear genetic programming

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