Sciweavers

1 search results - page 1 / 1
» Softening the Structural Difficulty in Genetic Programming w...
Sort
View
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
13 years 10 months ago
Softening the Structural Difficulty in Genetic Programming with TAG-Based Representation and Insertion/Deletion Operators
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
Nguyen Xuan Hoai, Robert I. McKay