Evolving reversible circuits for the even-parity problem

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

@InProceedings{oltean:evows05,

• author = "Mihai Oltean",
• title = "Evolving reversible circuits for the even-parity problem",
• booktitle = "Applications of Evolutionary Computing, EvoWorkshops2005: {EvoBIO}, {EvoCOMNET}, {EvoHOT}, {EvoIASP}, {EvoMUSART}, {EvoSTOC}",
• year = "2005",
• month = "30 " # mar # "-1 " # apr,
• editor = "Franz Rothlauf and Juergen Branke and Stefano Cagnoni and David W. Corne and Rolf Drechsler and Yaochu Jin and Penousal Machado and Elena Marchiori and Juan Romero and George D. Smith and Giovanni Squillero",
• series = "LNCS",
• volume = "3449",
• publisher = "Springer Verlag",
• address = "Lausanne, Switzerland",
• publisher_address = "Berlin",
• pages = "225--234",
• keywords = "genetic algorithms, genetic programming, evolutionary computation, MEP",
• ISBN = "3-540-25396-3",
• ISSN = "0302-9743",
• DOI = "doi:10.1007/b106856",
• abstract = "Reversible computing basically means computation with less or not at all electrical power. Since the standard binary gates are not usually reversible we use the Fredkin gate in order to achieve reversibility. An algorithm for designing reversible digital circuits is described in this paper. The algorithm is based on Multi Expression Programming (MEP), a Genetic Programming variant with a linear representation of individuals. The case of digital circuits for the even-parity problem is investigated. Numerical experiments show that the MEP-based algorithm is able to easily design reversible digital circuits for up to the even-8- parity problem.",
• notes = "EvoWorkshops2005",

}

Genetic Programming entries for Mihai Oltean

Citations