What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming

DOI10.1023/A:1011504414730zbMath1035.68587OpenAlexW1714918242MaRDI QIDQ4792724

Jason M. Daida, Omer A. Chaudhri, Robert R. Bertram, Shahbaz A. Chaudhary, Jonathan C. Khoo, John A. Polito II, Stephen Stanhope

Publication date: 17 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:1011504414730

zbMATH Keywords

test problemsproblem difficultyfitness landscapesGP theory

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 (1)

Uncertain decision tree for bank marketing classification

Uses Software

• MersenneTwister

This page was built for publication: What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming