Generating SAT Local-Search Heuristics using a GP Hyper-Heuristic Framework

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

  author =       "Mohamed Bader-El-Den and Riccardo Poli",
  title =        "Generating SAT Local-Search Heuristics using a GP
                 Hyper-Heuristic Framework",
  booktitle =    "Evolution Artificielle, 8th International Conference",
  year =         "2007",
  editor =       "Nicolas Monmarch{\'e} and El-Ghazali Talbi and 
                 Pierre Collet and Marc Schoenauer and Evelyne Lutton",
  volume =       "4926",
  series =       "Lecture Notes in Computer Science",
  pages =        "37--49",
  address =      "Tours, France",
  month =        "29-31 " # oct,
  publisher =    "Springer",
  keywords =     "genetic algorithms, genetic programming",
  isbn13 =       "978-3-540-79304-5",
  DOI =          "doi:10.1007/978-3-540-79305-2_4",
  abstract =     "We present GP-HH, a framework for evolving
                 local-search 3-SAT heuristics based on GP. The aim is
                 to obtain disposable heuristics which are evolved and
                 used for a specific subset of instances of a problem.
                 We test the heuristics evolved by GP-HH against
                 well-known local-search heuristics on a variety of
                 benchmark SAT problems. Results are very encouraging.",
  notes =        "EA'07",

Genetic Programming entries for Mohamed Bahy Bader-El-Den Riccardo Poli