From Binary to Continuous Gates - and Back Again

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

@InProceedings{Bechmann:2010:ICES,
  author =       "Matthias Bechmann and Angelika Sebald and 
                 Susan Stepney",
  title =        "From Binary to Continuous Gates - and Back Again",
  booktitle =    "Proceedings of the 9th International Conference
                 Evolvable Systems: From Biology to Hardware, ICES
                 2010",
  year =         "2010",
  editor =       "Gianluca Tempesti and Andy M. Tyrrell and 
                 Julian F. Miller",
  series =       "Lecture Notes in Computer Science",
  volume =       "6274",
  pages =        "335--347",
  address =      "York",
  month =        sep # " 6-8",
  publisher =    "Springer",
  keywords =     "genetic algorithms, genetic programming, cartesian
                 genetic programming",
  isbn13 =       "978-3-642-15322-8",
  annote =       "The Pennsylvania State University CiteSeerX Archives",
  bibsource =    "OAI-PMH server at citeseerx.ist.psu.edu",
  language =     "en",
  oai =          "oai:CiteSeerX.psu:10.1.1.386.7390",
  rights =       "Metadata may be used without restrictions as long as
                 the oai identifier remains attached to it.",
  URL =          "http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.386.7390",
  URL =          "http://www-users.cs.york.ac.uk/~susan/bib/ss/nonstd/ices10.pdf",
  DOI =          "doi:10.1007/978-3-642-15323-5_29",
  abstract =     "We describe how nuclear magnetic resonance (NMR)
                 spectroscopy can serve as a substrate for the
                 implementation of classical logic gates. The approach
                 exploits the inherently continuous nature of the NMR
                 parameter space. We show how simple continuous NAND
                 gates with sin/sin and sin/sinc characteristics arise
                 from the NMR parameter space. We use these simple
                 continuous NAND gates as starting points to obtain
                 optimised target NAND circuits with robust,
                 error-tolerant properties. We use Cartesian Genetic
                 Programming (CGP) as our optimisation tool. The various
                 evolved circuits display patterns relating to the
                 symmetry properties of the initial simple continuous
                 gates. Other circuits, such as a robust XOR circuit
                 built from simple NAND gates, are obtained using
                 similar strategies. We briefly mention the possibility
                 to include other target objective functions, for
                 example other continuous functions. Simple continuous
                 NAND gates with sin/sin characteristics are a good
                 starting point for the creation of error-tolerant
                 circuits whereas the more complicated sin/sinc gate
                 characteristics offer potential for the implementation
                 of complicated functions by choosing some
                 straightforward, experimentally controllable parameters
                 appropriately.",
  affiliation =  "Department of Chemistry, University of York, YO10 5DD
                 UK",
}

Genetic Programming entries for Matthias Bechmann Angelika Sebald Susan Stepney

Citations