Finding compact BDDs using genetic programming

Ulrich Kühne; Nicole Drechsler

doi:10.1007/11732242_28

Finding compact BDDs using genetic programming

Ulrich Kühne
, Nicole Drechsler

University of Bremen

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

Résumé

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 constrast to the minimization 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.

langue originale	Anglais
titre	Applications of Evolutionary Computing - EvoWorkshops 2006
Sous-titre	EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC, Proceedings
Editeur	Springer Verlag
Pages	308-319
Nombre de pages	12
ISBN (imprimé)	3540332375, 9783540332374
Les DOIs	https://doi.org/10.1007/11732242_28
état	Publié - 1 janv. 2006
Modification externe	Oui
Evénement	EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC - Budapest, Hongrie Durée: 10 avr. 2006 → 12 avr. 2006

Série de publications

Nom	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	3907 LNCS
ISSN (imprimé)	0302-9743
ISSN (Electronique)	1611-3349

Une conférence

Une conférence	EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC
Pays/Territoire	Hongrie
La ville	Budapest
période	10/04/06 → 12/04/06

Accès au document

10.1007/11732242_28

Autres fichiers et liens

Lien vers la publication dans Scopus

Contient cette citation

Kühne, U., & Drechsler, N. (2006). Finding compact BDDs using genetic programming. Dans Applications of Evolutionary Computing - EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC, Proceedings (p. 308-319). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 3907 LNCS). Springer Verlag. https://doi.org/10.1007/11732242_28

Kühne, Ulrich ; Drechsler, Nicole. / Finding compact BDDs using genetic programming. Applications of Evolutionary Computing - EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC, Proceedings. Springer Verlag, 2006. p. 308-319 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{b13055ea062e49bfaa01b4b42f21f91a,

title = "Finding compact BDDs using genetic programming",

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 constrast to the minimization 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.",

author = "Ulrich K{\"u}hne and Nicole Drechsler",

year = "2006",

month = jan,

day = "1",

doi = "10.1007/11732242\_28",

language = "English",

isbn = "3540332375",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "308--319",

booktitle = "Applications of Evolutionary Computing - EvoWorkshops 2006",

note = "EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC ; Conference date: 10-04-2006 Through 12-04-2006",

}

Kühne, U & Drechsler, N 2006, Finding compact BDDs using genetic programming. Dans Applications of Evolutionary Computing - EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), VOL. 3907 LNCS, Springer Verlag, p. 308-319, EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC, Budapest, Hongrie, 10/04/06. https://doi.org/10.1007/11732242_28

Finding compact BDDs using genetic programming. / Kühne, Ulrich; Drechsler, Nicole.
Applications of Evolutionary Computing - EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC, Proceedings. Springer Verlag, 2006. p. 308-319 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol 3907 LNCS).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

TY - GEN

T1 - Finding compact BDDs using genetic programming

AU - Kühne, Ulrich

AU - Drechsler, Nicole

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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 constrast to the minimization 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.

AB - 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 constrast to the minimization 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.

UR - https://www.scopus.com/pages/publications/33745768133

U2 - 10.1007/11732242_28

DO - 10.1007/11732242_28

M3 - Conference contribution

AN - SCOPUS:33745768133

SN - 3540332375

SN - 9783540332374

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 308

EP - 319

BT - Applications of Evolutionary Computing - EvoWorkshops 2006

PB - Springer Verlag

T2 - EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC

Y2 - 10 April 2006 through 12 April 2006

ER -

Kühne U, Drechsler N. Finding compact BDDs using genetic programming. Dans Applications of Evolutionary Computing - EvoWorkshops 2006: EvoBIO, EvoCOMNET, EvoHOT, EvoIASP, EvoINTERACTION, EvoMUSART, and EvoSTOC, Proceedings. Springer Verlag. 2006. p. 308-319. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/11732242_28

Finding compact BDDs using genetic programming

Résumé

Série de publications

Une conférence

Accès au document

Autres fichiers et liens

Empreinte digitale

Contient cette citation