Graph Based Crossover-A Case Study with the Busy Beaver Problem

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

@InProceedings{pereira:1999:GBCCSBBP,

• author = "Francisco B. Pereira and Penousal Machado and Ernesto Costa and Amilcar Cardoso",
• title = "Graph Based Crossover-A Case Study with the Busy Beaver Problem",
• booktitle = "Proceedings of the Genetic and Evolutionary Computation Conference",
• year = "1999",
• editor = "Wolfgang Banzhaf and Jason Daida and Agoston E. Eiben and Max H. Garzon and Vasant Honavar and Mark Jakiela and Robert E. Smith",
• volume = "2",
• pages = "1149--1155",
• address = "Orlando, Florida, USA",
• publisher_address = "San Francisco, CA 94104, USA",
• month = "13-17 " # jul,
• publisher = "Morgan Kaufmann",
• keywords = "genetic algorithms, genetic programming",
• ISBN = "1-55860-611-4",
• URL = "http://gpbib.cs.ucl.ac.uk/gecco1999/GP-429.pdf",
• URL = "http://gpbib.cs.ucl.ac.uk/gecco1999/GP-429.ps",
• size = "7 pages",
• abstract = "The success of the application of evolutionary approaches depends, to a large extent, on problem representation and on the used genetic operators. In this paper we introduce a new graph based crossover operator and compare it with classical two-point crossover. The study was carried out using a theoretical hard problem known as Busy Beaver. This problem involves the search for the Turing Machine that produces the maximum number of ones when started on a blank tape. Experimental results show that, in this domain, the new graph-based operator provides a clear advantage over two-point crossover.",
• notes = "GECCO-99 A joint meeting of the eighth international conference on genetic algorithms (ICGA-99) and the fourth annual genetic programming conference (GP-99)",

}

Genetic Programming entries for Francisco Jose Baptista Pereira Penousal Machado Ernesto Costa F Amilcar Cardoso

Citations