Late-acceptance Hill-climbing with a Grammatical Program Representation

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

@InProceedings{McDermott:2017:GECCO,
  author =       "James McDermott and Miguel Nicolau",
  title =        "Late-acceptance Hill-climbing with a Grammatical
                 Program Representation",
  booktitle =    "Proceedings of the Genetic and Evolutionary
                 Computation Conference Companion",
  series =       "GECCO '17",
  year =         "2017",
  isbn13 =       "978-1-4503-4939-0",
  address =      "Berlin, Germany",
  pages =        "241--242",
  size =         "2 pages",
  URL =          "http://doi.acm.org/10.1145/3067695.3075984",
  DOI =          "doi:10.1145/3067695.3075984",
  acmid =        "3075984",
  publisher =    "ACM",
  publisher_address = "New York, NY, USA",
  keywords =     "genetic algorithms, genetic programming, grammar,
                 hill-climbing",
  month =        "15-19 " # jul,
  abstract =     "The late-acceptance hill-climbing (LAHC) metaheuristic
                 is a stochastic hill-climbing algorithm with a simple
                 history mechanism, proposed by Burke and Bykov in 2008,
                 which seems to give a remarkable and reliable
                 performance improvement relative to hill-climbing
                 itself. LAHC is here used for the first time for
                 genetic programming problems, with a grammatical
                 encoding. A novel variant of LAHC with an initial
                 random sampling is also proposed. Performance of both
                 is competitive with full population-based search.",
  notes =        "Also known as
                 \cite{McDermott:2017:LHG:3067695.3075984} GECCO-2017 A
                 Recombination of the 26th International Conference on
                 Genetic Algorithms (ICGA-2017) and the 22nd Annual
                 Genetic Programming Conference (GP-2017)",
}

Genetic Programming entries for James McDermott Miguel Nicolau

Citations