What Makes a Problem GP-Hard? A Look at How Structure Affects Content

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

@InCollection{daida:2003:GPTP,
  author =       "Jason M. Daida",
  title =        "What Makes a Problem GP-Hard? A Look at How Structure
                 Affects Content",
  booktitle =    "Genetic Programming Theory and Practice",
  publisher =    "Kluwer",
  year =         "2003",
  editor =       "Rick L. Riolo and Bill Worzel",
  chapter =      "7",
  pages =        "99--118",
  keywords =     "genetic algorithms, genetic programming, GP theory,
                 tree structures, problem difficulty, GP-hard, test
                 problems",
  ISBN =         "1-4020-7581-2",
  URL =          "http://www.springer.com/computer/ai/book/978-1-4020-7581-0",
  DOI =          "doi:10.1007/978-1-4419-8983-3_7",
  abstract =     "Theoretical work at the University of Michigan that
                 concerns the question 'What makes a problem difficult
                 for genetic programming to solve?' Specifically
                 describes linkages between content, tree structures,
                 and problem difficulty in genetic programming. The
                 significance of structure in influencing problem
                 difficulty.",
  notes =        "great pictures Part of \cite{RioloWorzel:2003}",
  size =         "19 pages",
}

Genetic Programming entries for Jason M Daida

Citations