Login / Signup
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming.
Jason M. Daida
John Polito
Steven A. Stanhope
Robert R. Bertram
Jonathan C. Khoo
Shahbaz A. Chaudhary
Published in:
GECCO (1999)
Keyphrases
</>
genetic programming
fitness function
evolutionary computation
symbolic regression
regression problems
evolutionary algorithm
gene expression programming
financial forecasting
image segmentation
bayesian networks
multiscale
cross validation
quantitative analysis
hyper heuristics
grammar guided genetic programming