scientific article; zbMATH DE number 1872150

DOI10.1023/A:1010024515191zbMATH Open1006.68634OpenAlexW2108928796MaRDI QIDQ4794697FDOQ4794697

Authors: William B. Langdon 

Publication date: 20 February 2003

Published in: Genetic Programming and Evolvable Machines (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1010024515191

Title of this publication is not available (Why is that?)

Recommendations

• scientific article; zbMATH DE number 2087190
• Efficient tree traversal to reduce code growth in tree-based genetic programming
• scientific article; zbMATH DE number 1700032
• scientific article; zbMATH DE number 1962052
• Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming

zbMATH Keywords

genetic algorithmsgenetic programmingevolution of shapebinary tree search spacesbloat reductionlinear depth growthsubquadratic length growthuniform initialization

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cited In (11)

• Title not available (Why is that?)
• Efficient tree traversal to reduce code growth in tree-based genetic programming
• Title not available (Why is that?)
• Neutral offspring controlling operators in genetic programming
• Destructiveness of lexicographic parsimony pressure and alleviation by a concatenation crossover in genetic programming
• Repeated patterns in genetic programming
• Simplification of genetic programs: a literature survey
• Title not available (Why is that?)
• Internal reinforcement in a connectionist genetic programming approach
• Title not available (Why is that?)
• Title not available (Why is that?)

This page was built for publication:

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