Gate-level Synthesis of Boolean Functions using Binary Multiplexers and Genetic Programming

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

@InProceedings{hernandez-aguirre:2000:gsbfbmgp,
  author =       "Arturo Hernandez-Aguirre and Bill P. Buckles and 
                 Carlos A. Coello-Coello",
  title =        "Gate-level Synthesis of {Boolean} Functions using
                 Binary Multiplexers and Genetic Programming",
  booktitle =    "Proceedings of the 2000 Congress on Evolutionary
                 Computation CEC00",
  year =         "2000",
  pages =        "675--682",
  address =      "La Jolla Marriott Hotel La Jolla, California, USA",
  publisher_address = "445 Hoes Lane, P.O. Box 1331, Piscataway, NJ
                 08855-1331, USA",
  month =        "6-9 " # jul,
  organisation = "IEEE Neural Network Council (NNC), Evolutionary
                 Programming Society (EPS), Institution of Electrical
                 Engineers (IEE)",
  publisher =    "IEEE Press",
  keywords =     "genetic algorithms, genetic programming, hybrid
                 systems, 1-control line multiplexer, Boolean functions,
                 application domain, binary multiplexers, fitness
                 function, gate-level synthesis, logic functions, truth
                 table, Boolean functions, binary decision diagrams,
                 logic design, multiplexing equipment",
  ISBN =         "0-7803-6375-2",
  URL =          "http://www.lania.mx/~ccoello/papers/hernandez00.ps.gz",
  URL =          "http://citeseer.ist.psu.edu/309980.html",
  DOI =          "doi:10.1109/CEC.2000.870363",
  size =         "8 pages",
  abstract =     "This paper presents a genetic programming approach for
                 the synthesis of logic functions by means of
                 multiplexers. The approach uses the 1-control line
                 multiplexer as the only design unit. Any logic function
                 (defined by a truth table) can be produced through the
                 replication of this single unit. Our fitness function
                 works in two stages: first, it finds feasible
                 solutions, and then it concentrates on the minimisation
                 of the circuit. The proposed approach does not require
                 any knowledge from the application domain.",
  notes =        "CEC-2000 - A joint meeting of the IEEE, Evolutionary
                 Programming Society, Galesia, and the IEE.

                 IEEE Catalog Number = 00TH8512,

                 Library of Congress Number = 00-018644",
}

Genetic Programming entries for Arturo Hernandez-Aguirre Bill Buckles Carlos Artemio Coello Coello

Citations