scientific article; zbMATH DE number 1872150

DOI10.1023/A:1010024515191zbMath1006.68634OpenAlexW2108928796MaRDI QIDQ4794697

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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Computing methodologies and applications (68U99)

Related Items (4)

Neutral offspring controlling operators in genetic programming ⋮ Simplification of genetic programs: a literature survey ⋮ Repeated patterns in genetic programming ⋮ Internal reinforcement in a connectionist genetic programming approach

This page was built for publication: