What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming (Q4792724)
From MaRDI portal
scientific article; zbMATH DE number 1870012
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming |
scientific article; zbMATH DE number 1870012 |
Statements
17 February 2003
0 references
problem difficulty
0 references
test problems
0 references
fitness landscapes
0 references
GP theory
0 references
What Makes a Problem GP-Hard? Analysis of a Tunably Difficult Problem in Genetic Programming (English)
0 references
