What Makes a Problem GP-Hard? Validating a Hypothesis of Structural Causes

Created by W.Langdon from gp-bibliography.bib Revision:1.8081

@InProceedings{daida3:2003:gecco,

• author = "Jason M. Daida and Hsiaolei Li and Ricky Tang and Adam M. Hilss",
• title = "What Makes a Problem {GP}-Hard? Validating a Hypothesis of Structural Causes",
• booktitle = "Genetic and Evolutionary Computation -- GECCO-2003",
• editor = "E. Cant{\'u}-Paz and J. A. Foster and K. Deb and D. Davis and R. Roy and U.-M. O'Reilly and H.-G. Beyer and R. Standish and G. Kendall and S. Wilson and M. Harman and J. Wegener and D. Dasgupta and M. A. Potter and A. C. Schultz and K. Dowsland and N. Jonoska and J. Miller",
• year = "2003",
• pages = "1665--1677",
• address = "Chicago",
• publisher_address = "Berlin",
• month = "12-16 " # jul,
• volume = "2724",
• series = "LNCS",
• ISBN = "3-540-40603-4",
• publisher = "Springer-Verlag",
• keywords = "genetic algorithms, genetic programming",
• DOI = "doi:10.1007/3-540-45110-2_60",
• abstract = "empirical test of a hypothesis, which describes the effects of structural mechanisms in genetic programming. In doing so, the paper offers a test problem anticipated by this hypothesis. The problem is tunably difficult, but has this property because tuning is accomplished through changes in structure. Content is not involved in tuning. The results support a prediction of the hypothesis - that GP search space is significantly constrained as an outcome of structural mechanisms.",
• notes = "GECCO-2003. A joint meeting of the twelfth International Conference on Genetic Algorithms (ICGA-2003) and the eighth Annual Genetic Programming Conference (GP-2003)",

}

Genetic Programming entries for Jason M Daida Hsiaolei Li Ricky Tang Adam M Hilss

Citations