Finding Compact BDDs Using Genetic Programming

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

  author =       "Ulrich Kuhne and Nicole Drechsler",
  title =        "Finding Compact {BDDs} Using Genetic Programming",
  booktitle =    "Applications of Evolutionary Computing,
                 EvoWorkshops2006: {EvoBIO}, {EvoCOMNET}, {EvoHOT},
                 {EvoIASP}, {EvoInteraction}, {EvoMUSART}, {EvoSTOC}",
  year =         "2006",
  month =        "10-12 " # apr,
  editor =       "Franz Rothlauf and Jurgen Branke and 
                 Stefano Cagnoni and Ernesto Costa and Carlos Cotta and 
                 Rolf Drechsler and Evelyne Lutton and Penousal Machado and 
                 Jason H. Moore and Juan Romero and George D. Smith and 
                 Giovanni Squillero and Hideyuki Takagi",
  series =       "LNCS",
  volume =       "3907",
  publisher =    "Springer Verlag",
  address =      "Budapest",
  publisher_address = "Berlin",
  keywords =     "genetic algorithms, genetic programming",
  ISBN =         "3-540-33237-5",
  pages =        "308--319",
  URL =          "",
  DOI =          "doi:10.1007/11732242_28",
  URL =          "",
  abstract =     "Binary Decision Diagrams (BDDs) can be used to design
                 multiplexor based circuits. Unfortunately, the most
                 commonly used kind of BDDs ? ordered BDDs ? has
                 exponential size in the number of variables for many
                 functions. In some cases, more general forms of BDDs
                 are more compact. In contrast to the minimisation of
                 OBDDs, which is well understood, there are no
                 heuristics for the construction of compact BDDs up to
                 today. In this paper we show that compact BDDs can be
                 constructed using Genetic Programming.",
  notes =        "part of \cite{evows06} also known as

Genetic Programming entries for Ulrich Kuhne Nicole Drechsler