Phenotypic Duplication and Inversion in Cartesian                  Genetic Programming applied to Boolean Function                  Learning 
Created by W.Langdon from
gp-bibliography.bib Revision:1.8612
- @InProceedings{kalkreuth:2022:GECCOcomp,
- 
  author =       "Roman Kalkreuth",
- 
  title =        "Phenotypic Duplication and Inversion in Cartesian
Genetic Programming applied to Boolean Function
Learning",
- 
  booktitle =    "Proceedings of the 2022 Genetic and Evolutionary
Computation Conference Companion",
- 
  year =         "2022",
- 
  editor =       "Heike Trautmann and Carola Doerr and 
Alberto Moraglio and Thomas Bartz-Beielstein and Bogdan Filipic and 
Marcus Gallagher and Yew-Soon Ong and 
Abhishek Gupta and Anna V Kononova and Hao Wang and 
Michael Emmerich and Peter A. N. Bosman and Daniela Zaharie and 
Fabio Caraffini and Johann Dreo and Anne Auger and 
Konstantin Dietric and Paul Dufosse and Tobias Glasmachers and 
Nikolaus Hansen and Olaf Mersmann and Petr Posik and 
Tea Tusar and Dimo Brockhoff and Tome Eftimov and 
Pascal Kerschke and Boris Naujoks and Mike Preuss and 
Vanessa Volz and Bilel Derbel and Ke Li and 
Xiaodong Li and Saul Zapotecas and Qingfu Zhang and 
Mark Coletti and Catherine (Katie) Schuman and 
Eric ``Siggy'' Scott and Robert Patton and Paul Wiegand and 
Jeffrey K. Bassett and Chathika Gunaratne and Tinkle Chugh and 
Richard Allmendinger and Jussi Hakanen and 
Daniel Tauritz and John Woodward and Manuel Lopez-Ibanez and 
John McCall and Jaume Bacardit and 
Alexander Brownlee and Stefano Cagnoni and Giovanni Iacca and 
David Walker and Jamal Toutouh and UnaMay O'Reilly and 
Penousal Machado and Joao Correia and Sergio Nesmachnow and 
Josu Ceberio and Rafael Villanueva and Ignacio Hidalgo and 
Francisco {Fernandez de Vega} and Giuseppe Paolo and 
Alex Coninx and Antoine Cully and Adam Gaier and 
Stefan Wagner and Michael Affenzeller and Bobby R. Bruce and 
Vesna Nowack and Aymeric Blot and Emily Winter and 
William B. Langdon and Justyna Petke and 
Silvino {Fernandez Alzueta} and Pablo {Valledor Pellicer} and 
Thomas Stuetzle and David Paetzel and 
Alexander Wagner and Michael Heider and Nadarajen Veerapen and 
Katherine Malan and Arnaud Liefooghe and Sebastien Verel and 
Gabriela Ochoa and Mohammad Nabi Omidvar and 
Yuan Sun and Ernesto Tarantino and De Falco Ivanoe and 
Antonio {Della Cioppa} and Scafuri Umberto and John Rieffel and 
Jean-Baptiste Mouret and Stephane Doncieux and 
Stefanos Nikolaidis and Julian Togelius and 
Matthew C. Fontaine and Serban Georgescu and Francisco Chicano and 
Darrell Whitley and Oleksandr Kyriienko and Denny Dahl and 
Ofer Shir and Lee Spector and Alma Rahat and 
Richard Everson and Jonathan Fieldsend and Handing Wang and 
Yaochu Jin and Erik Hemberg and Marwa A. Elsayed and 
Michael Kommenda and William {La Cava} and 
Gabriel Kronberger and Steven Gustafson",
- 
  pages =        "566--569",
- 
  address =      "Boston, USA",
- 
  series =       "GECCO '22",
- 
  month =        "9-13 " # jul,
- 
  organisation = "SIGEVO",
- 
  publisher =    "Association for Computing Machinery",
- 
  publisher_address = "New York, NY, USA",
- 
  keywords =     "genetic algorithms, genetic programming, cartesian
genetic programming, inversion, duplication, boolean
function learning, mutation",
- 
  isbn13 =       "978-1-4503-9268-6/22/07",
- 
  DOI =          " 10.1145/3520304.3529065", 10.1145/3520304.3529065",
- 
  abstract =     "The search performance of Cartesian Genetic
Programming (CGP) relies to a large extent on the sole
use of genotypic point mutation in combination with
extremely large redundant genotypes. Over the last
years, steps have been taken to extend CGP's variation
mechanisms by the introduction of advanced methods for
recombination and mutation. One branch of these
contributions addresses phenotypic variation in CGP.
However, recent studies have demonstrated the
limitations of phenotypic recombination in Boolean
function learning and highlighted the effectiveness of
the mutation-only approach. Therefore, in this work, we
further explore phenotypic mutation in CGP by the
introduction and evaluation of two phenotypic mutation
operators that are inspired by chromosomal
rearrangement. Our initial findings show that the
proposed methods can significantly improve the search
performance of CGP on various single- and
multiple-output Boolean function benchmarks.",
- 
  notes =        "GECCO-2022 A Recombination of the 31st International
Conference on Genetic Algorithms (ICGA) and the 27th
Annual Genetic Programming Conference (GP)",
- }
Genetic Programming entries for 
Roman Tobias Kalkreuth
Citations
