- author = "Cezary Z. Janikow and John Aleshunas and Mark W. Hauschild",
- title = "Second order heuristics in {ACGP}",
- booktitle = "Optimization by building and using probabilistic models (OBUPM-2011)",
- year = "2011",
- editor = "Mark Hauschild and Martin Pelikan",
- publisher = "ACM",
- publisher_address = "New York, NY, USA",
- pages = "671--678",
- month = "12-16 " # jul,
- organisation = "SIGEVO",
- address = "Dublin, Ireland",
- keywords = "genetic algorithms, genetic programming, Heuristics, Search Space",
- isbn13 = "978-1-4503-0690-4",
-
URL = "
http://umsl.edu/cmpsci/about/People/Faculty/CezaryJanikow/folder%20two/secondorder.pdf",
-
DOI = "
10.1145/2001858.2002066",
- size = "8 pages",
- abstract = "Genetic Programming explores the problem search space by means of operators and selection. Mutation and crossover operators apply uniformly, while selection is the driving force for the search. Constrained GP changes the uniform exploration to pruned non-uniform, skipping some subspaces and giving preferences to others, according to some heuristics. Adaptable Constrained GP is a methodology for discovery of such useful heuristics. Both methodologies have previously demonstrated their surprising capabilities using only first-order (parent-child) heuristics. Recently, they have been extended to second-order (parent-children) heuristics. This paper describes the second-order processing, and illustrates the usefulness and efficiency of this approach using a simple problem specifically constructed to exhibit strong second-order structure.",
-
notes = "University of Missouri-St Louis St. Louis, MO 63121
Also known as \cite{2002066} Distributed on CD-ROM at
GECCO-2011.
ACM Order Number 910112.",
