Avoiding Two-Bit Crossovers in Genetic Programming

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

@InProceedings{kessler:1998:a2xGP,

• author = "Matthew W. Kessler",
• title = "Avoiding Two-Bit Crossovers in Genetic Programming",
• booktitle = "Late Breaking Papers at the Genetic Programming 1998 Conference",
• year = "1998",
• editor = "John R. Koza",
• pages = "115--119",
• address = "University of Wisconsin, Madison, Wisconsin, USA",
• publisher_address = "Stanford, CA, USA",
• month = "22-25 " # jul,
• publisher = "Stanford University Bookstore",
• keywords = "genetic algorithms, genetic programming",
• URL = "http://citeseer.ist.psu.edu/cache/papers/cs/2284/http:zSzzSzadept.cs.twsu.eduzSz~thomaszSztwobit.pdf/avoiding-two-bit-crossovers.pdf",
• URL = "http://citeseer.ist.psu.edu/13724.html",
• broken = "http://www.cs.twsu.edu/~haynes/twobit.ps",
• size = "5 pages",
• abstract = "We investigate the utility of weighting the crossover points in genetic programming. The depth-fair crossover (DFC) operator is introduced as an alternative to the standard 90/10 weight heuristic. The DFC weight heuristic performs better that the standard 90/10 weight heuristic in the clique domain. Preliminary results also indicate it will perform better in other applications.",
• notes = "GP-98LB url refers to joint paper with Thomas D. Haynes",

}

Genetic Programming entries for Matthew W Kessler

Citations