Efficient tree traversal to reduce code growth in tree-based genetic programming

DOI10.1007/S10732-007-9060-0MaRDI QIDQ1009203zbMATH OpenOpenAlexFDO

Authors Bart Wyns, Luc Boullart

Publication date 31 March 2009

Published in Journal of Heuristics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10732-007-9060-0

zbMATH Keywords

Local optimizationCode growthSubtree fitnessTree traversalTree-based genetic programming

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Artificial Evolution
• scientific article; zbMATH DE number 1872150
• scientific article; zbMATH DE number 1617340
• scientific article; zbMATH DE number 1962076
• scientific article; zbMATH DE number 2044678

Cited in

(8)

• scientific article; zbMATH DE number 2040716 (Why is no real title available?)
• scientific article; zbMATH DE number 1962057 (Why is no real title available?)
• scientific article; zbMATH DE number 1869979 (Why is no real title available?)
• scientific article; zbMATH DE number 1962012 (Why is no real title available?)
• scientific article; zbMATH DE number 2040706 (Why is no real title available?)
• scientific article; zbMATH DE number 1617340 (Why is no real title available?)
• scientific article; zbMATH DE number 2087190 (Why is no real title available?)
• scientific article; zbMATH DE number 1872150 (Why is no real title available?)

Describes a project that uses

Uses Software

• UCI

This page was built for publication: Efficient tree traversal to reduce code growth in tree-based genetic programming

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