%0 Conference Paper %1 pereira:1999:GBCCSBBP %A Pereira, Francisco B. %A Machado, Penousal %A Costa, Ernesto %A Cardoso, Amilcar %B Proceedings of the Genetic and Evolutionary Computation Conference %C Orlando, Florida, USA %D 1999 %E Banzhaf, Wolfgang %E Daida, Jason %E Eiben, Agoston E. %E Garzon, Max H. %E Honavar, Vasant %E Jakiela, Mark %E Smith, Robert E. %I Morgan Kaufmann %K algorithms, and evolvable genetic hardware programming %P 1149--1155 %T Graph Based Crossover-A Case Study with the Busy Beaver Problem %U http://www.cs.bham.ac.uk/~wbl/biblio/gecco1999/GP-429.ps %V 2 %X 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. %@ 1-55860-611-4

@inproceedings{pereira:1999:GBCCSBBP, 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.}, added-at = {2008-06-19T17:46:40.000+0200}, address = {Orlando, Florida, USA}, author = {Pereira, Francisco B. and Machado, Penousal and Costa, Ernesto and Cardoso, Amilcar}, biburl = {https://www.bibsonomy.org/bibtex/283da54b1c6f0fe95986535c1d98a9fae/brazovayeye}, booktitle = {Proceedings of the Genetic and Evolutionary Computation Conference}, editor = {Banzhaf, Wolfgang and Daida, Jason and Eiben, Agoston E. and Garzon, Max H. and Honavar, Vasant and Jakiela, Mark and Smith, Robert E.}, interhash = {52e06cf6c4c979425430780e6542ff17}, intrahash = {83da54b1c6f0fe95986535c1d98a9fae}, isbn = {1-55860-611-4}, keywords = {algorithms, and evolvable genetic hardware programming}, month = {13-17 July}, 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)}, pages = {1149--1155}, publisher = {Morgan Kaufmann}, publisher_address = {San Francisco, CA 94104, USA}, size = {7 pages}, timestamp = {2008-06-19T17:49:25.000+0200}, title = {Graph Based Crossover-{A} Case Study with the Busy Beaver Problem}, url = {http://www.cs.bham.ac.uk/~wbl/biblio/gecco1999/GP-429.ps}, volume = 2, year = 1999 }