Disjoint Sum of Product Minimization by Evolutionary Algorithms
Recently, an approach has been presented to minimize Disjoint Sum-of-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for large problem instances, the method is orders of magnitude faster than previous enumerative techniques. But the quality of t...
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 207 |
|---|---|
| container_issue | |
| container_start_page | 198 |
| container_title | |
| container_volume | 3005 |
| creator | Drechsler, Nicole Hilgemeier, Mario Fey, Görschwin Drechsler, Rolf |
| description | Recently, an approach has been presented to minimize Disjoint Sum-of-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for large problem instances, the method is orders of magnitude faster than previous enumerative techniques. But the quality of the approach largely depends on the variable ordering of the underlying BDD.
This paper presents an Evolutionary Algorithm (EA) to optimize the DSOP representation of a given Boolean function. The EA is used to find an optimized variable ordering for the BDD representation. Then the DSOP is derived from the optimized BDD using structural and symbolic techniques. Experiments are performed to adjust the parameters of the EA. Experimental results are given to demonstrate the efficiency of the approach. |
| doi_str_mv | 10.1007/978-3-540-24653-4_21 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>proquest_pasca</sourceid><recordid>TN_cdi_pascalfrancis_primary_15735565</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>EBC3087929_28_217</sourcerecordid><originalsourceid>FETCH-LOGICAL-p272t-f18f0e7256060e6e94faa26739bbb3e1ceaa61fc715acef579bafc75b95280bc3</originalsourceid><addsrcrecordid>eNotkMtOwzAQRc1ThNI_YJENS4MfcRyvECrlIRWBBKwtxzitSxIHO0EqX4_TdjajuXfuaHQAuMToGiPEbwQvIIUsQ5BkOaMwkwQfgGmUaRS3WnYIEpxjDCnNxBE43xqYxo1jkCCKCBQ8o6cgEdEvEGLsDExDWKNYGGVMiATc3tuwdrbt0_ehSV2Vvnn3Neg-fbGtbeyf6q1r03KTzn9dPYyD8pv0rl46b_tVEy7ASaXqYKb7PgGfD_OP2RNcvD4-z-4WsCOc9LDCRYUMJyxHOTK5EVmlFMk5FWVZUoO1USrHleaYKW0qxkWp4sRKwUiBSk0n4Gp3t1NBq7ryqtU2yM7bJj4kMeOUschkAshuL0SrXRovS-e-g8RIjlhl5CepjKDkFqEcscYQ3R_37mcwoZdmTGnT9l7VeqW63vggKSq4IEKSIoY4_QeJlnYz</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype><pqid>EBC3087929_28_217</pqid></control><display><type>book_chapter</type><title>Disjoint Sum of Product Minimization by Evolutionary Algorithms</title><source>Springer Books</source><creator>Drechsler, Nicole ; Hilgemeier, Mario ; Fey, Görschwin ; Drechsler, Rolf</creator><contributor>Raidl, Günther R ; Branke, Jürgen ; Corne, David W ; Rothlauf, Franz ; Jin, Yaochu ; Johnson, Colin G ; Drechsler, Rolf ; Marchiori, Elena ; Machado, Penousal ; Cagnoni, Stefano ; Drechsler, Rolf ; Raidl, Günther R. ; Johnson, Colin G. ; Rothlauf, Franz ; Branke, Jürgen ; Corne, David Wolfe ; Jin, Yaochu ; Squillero, Giovanni ; Marchiori, Elena ; Machado, Penousal ; Cagnoni, Stefano ; Smith, George D.</contributor><creatorcontrib>Drechsler, Nicole ; Hilgemeier, Mario ; Fey, Görschwin ; Drechsler, Rolf ; Raidl, Günther R ; Branke, Jürgen ; Corne, David W ; Rothlauf, Franz ; Jin, Yaochu ; Johnson, Colin G ; Drechsler, Rolf ; Marchiori, Elena ; Machado, Penousal ; Cagnoni, Stefano ; Drechsler, Rolf ; Raidl, Günther R. ; Johnson, Colin G. ; Rothlauf, Franz ; Branke, Jürgen ; Corne, David Wolfe ; Jin, Yaochu ; Squillero, Giovanni ; Marchiori, Elena ; Machado, Penousal ; Cagnoni, Stefano ; Smith, George D.</creatorcontrib><description>Recently, an approach has been presented to minimize Disjoint Sum-of-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for large problem instances, the method is orders of magnitude faster than previous enumerative techniques. But the quality of the approach largely depends on the variable ordering of the underlying BDD.
This paper presents an Evolutionary Algorithm (EA) to optimize the DSOP representation of a given Boolean function. The EA is used to find an optimized variable ordering for the BDD representation. Then the DSOP is derived from the optimized BDD using structural and symbolic techniques. Experiments are performed to adjust the parameters of the EA. Experimental results are given to demonstrate the efficiency of the approach.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540213783</identifier><identifier>ISBN: 9783540213789</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540246534</identifier><identifier>EISBN: 3540246533</identifier><identifier>DOI: 10.1007/978-3-540-24653-4_21</identifier><identifier>OCLC: 934980055</identifier><identifier>LCCallNum: Q334-342</identifier><language>eng</language><publisher>Germany: Springer Berlin / Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Benchmark Function ; Binary Decision Diagram ; Boolean Function ; Computer science; control theory; systems ; Crossover Operator ; Evolutionary Algorithm ; Exact sciences and technology ; Theoretical computing</subject><ispartof>Applications of Evolutionary Computing, 2004, Vol.3005, p.198-207</ispartof><rights>Springer-Verlag Berlin Heidelberg 2004</rights><rights>2004 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Uhttps://ebookcentral.proquest.com/covers/3087929-l.jpg</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/978-3-540-24653-4_21$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/978-3-540-24653-4_21$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,779,780,784,789,790,793,4050,4051,27925,38255,41442,42511</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15735565$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Raidl, Günther R</contributor><contributor>Branke, Jürgen</contributor><contributor>Corne, David W</contributor><contributor>Rothlauf, Franz</contributor><contributor>Jin, Yaochu</contributor><contributor>Johnson, Colin G</contributor><contributor>Drechsler, Rolf</contributor><contributor>Marchiori, Elena</contributor><contributor>Machado, Penousal</contributor><contributor>Cagnoni, Stefano</contributor><contributor>Drechsler, Rolf</contributor><contributor>Raidl, Günther R.</contributor><contributor>Johnson, Colin G.</contributor><contributor>Rothlauf, Franz</contributor><contributor>Branke, Jürgen</contributor><contributor>Corne, David Wolfe</contributor><contributor>Jin, Yaochu</contributor><contributor>Squillero, Giovanni</contributor><contributor>Marchiori, Elena</contributor><contributor>Machado, Penousal</contributor><contributor>Cagnoni, Stefano</contributor><contributor>Smith, George D.</contributor><creatorcontrib>Drechsler, Nicole</creatorcontrib><creatorcontrib>Hilgemeier, Mario</creatorcontrib><creatorcontrib>Fey, Görschwin</creatorcontrib><creatorcontrib>Drechsler, Rolf</creatorcontrib><title>Disjoint Sum of Product Minimization by Evolutionary Algorithms</title><title>Applications of Evolutionary Computing</title><description>Recently, an approach has been presented to minimize Disjoint Sum-of-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for large problem instances, the method is orders of magnitude faster than previous enumerative techniques. But the quality of the approach largely depends on the variable ordering of the underlying BDD.
This paper presents an Evolutionary Algorithm (EA) to optimize the DSOP representation of a given Boolean function. The EA is used to find an optimized variable ordering for the BDD representation. Then the DSOP is derived from the optimized BDD using structural and symbolic techniques. Experiments are performed to adjust the parameters of the EA. Experimental results are given to demonstrate the efficiency of the approach.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Benchmark Function</subject><subject>Binary Decision Diagram</subject><subject>Boolean Function</subject><subject>Computer science; control theory; systems</subject><subject>Crossover Operator</subject><subject>Evolutionary Algorithm</subject><subject>Exact sciences and technology</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540213783</isbn><isbn>9783540213789</isbn><isbn>9783540246534</isbn><isbn>3540246533</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2004</creationdate><recordtype>book_chapter</recordtype><recordid>eNotkMtOwzAQRc1ThNI_YJENS4MfcRyvECrlIRWBBKwtxzitSxIHO0EqX4_TdjajuXfuaHQAuMToGiPEbwQvIIUsQ5BkOaMwkwQfgGmUaRS3WnYIEpxjDCnNxBE43xqYxo1jkCCKCBQ8o6cgEdEvEGLsDExDWKNYGGVMiATc3tuwdrbt0_ehSV2Vvnn3Neg-fbGtbeyf6q1r03KTzn9dPYyD8pv0rl46b_tVEy7ASaXqYKb7PgGfD_OP2RNcvD4-z-4WsCOc9LDCRYUMJyxHOTK5EVmlFMk5FWVZUoO1USrHleaYKW0qxkWp4sRKwUiBSk0n4Gp3t1NBq7ryqtU2yM7bJj4kMeOUschkAshuL0SrXRovS-e-g8RIjlhl5CepjKDkFqEcscYQ3R_37mcwoZdmTGnT9l7VeqW63vggKSq4IEKSIoY4_QeJlnYz</recordid><startdate>2004</startdate><enddate>2004</enddate><creator>Drechsler, Nicole</creator><creator>Hilgemeier, Mario</creator><creator>Fey, Görschwin</creator><creator>Drechsler, Rolf</creator><general>Springer Berlin / Heidelberg</general><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>FFUUA</scope><scope>IQODW</scope></search><sort><creationdate>2004</creationdate><title>Disjoint Sum of Product Minimization by Evolutionary Algorithms</title><author>Drechsler, Nicole ; Hilgemeier, Mario ; Fey, Görschwin ; Drechsler, Rolf</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p272t-f18f0e7256060e6e94faa26739bbb3e1ceaa61fc715acef579bafc75b95280bc3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2004</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Benchmark Function</topic><topic>Binary Decision Diagram</topic><topic>Boolean Function</topic><topic>Computer science; control theory; systems</topic><topic>Crossover Operator</topic><topic>Evolutionary Algorithm</topic><topic>Exact sciences and technology</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Drechsler, Nicole</creatorcontrib><creatorcontrib>Hilgemeier, Mario</creatorcontrib><creatorcontrib>Fey, Görschwin</creatorcontrib><creatorcontrib>Drechsler, Rolf</creatorcontrib><collection>ProQuest Ebook Central - Book Chapters - Demo use only</collection><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Drechsler, Nicole</au><au>Hilgemeier, Mario</au><au>Fey, Görschwin</au><au>Drechsler, Rolf</au><au>Raidl, Günther R</au><au>Branke, Jürgen</au><au>Corne, David W</au><au>Rothlauf, Franz</au><au>Jin, Yaochu</au><au>Johnson, Colin G</au><au>Drechsler, Rolf</au><au>Marchiori, Elena</au><au>Machado, Penousal</au><au>Cagnoni, Stefano</au><au>Drechsler, Rolf</au><au>Raidl, Günther R.</au><au>Johnson, Colin G.</au><au>Rothlauf, Franz</au><au>Branke, Jürgen</au><au>Corne, David Wolfe</au><au>Jin, Yaochu</au><au>Squillero, Giovanni</au><au>Marchiori, Elena</au><au>Machado, Penousal</au><au>Cagnoni, Stefano</au><au>Smith, George D.</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>Disjoint Sum of Product Minimization by Evolutionary Algorithms</atitle><btitle>Applications of Evolutionary Computing</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2004</date><risdate>2004</risdate><volume>3005</volume><spage>198</spage><epage>207</epage><pages>198-207</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540213783</isbn><isbn>9783540213789</isbn><eisbn>9783540246534</eisbn><eisbn>3540246533</eisbn><abstract>Recently, an approach has been presented to minimize Disjoint Sum-of-Products (DSOPs) based on Binary Decision Diagrams (BDDs). Due to the symbolic representation of cubes for large problem instances, the method is orders of magnitude faster than previous enumerative techniques. But the quality of the approach largely depends on the variable ordering of the underlying BDD.
This paper presents an Evolutionary Algorithm (EA) to optimize the DSOP representation of a given Boolean function. The EA is used to find an optimized variable ordering for the BDD representation. Then the DSOP is derived from the optimized BDD using structural and symbolic techniques. Experiments are performed to adjust the parameters of the EA. Experimental results are given to demonstrate the efficiency of the approach.</abstract><cop>Germany</cop><pub>Springer Berlin / Heidelberg</pub><doi>10.1007/978-3-540-24653-4_21</doi><oclcid>934980055</oclcid><tpages>10</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Applications of Evolutionary Computing, 2004, Vol.3005, p.198-207 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_15735565 |
| source | Springer Books |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Benchmark Function Binary Decision Diagram Boolean Function Computer science control theory systems Crossover Operator Evolutionary Algorithm Exact sciences and technology Theoretical computing |
| title | Disjoint Sum of Product Minimization by Evolutionary Algorithms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-08T05%3A40%3A05IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_pasca&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=bookitem&rft.atitle=Disjoint%20Sum%20of%20Product%20Minimization%20by%20Evolutionary%20Algorithms&rft.btitle=Applications%20of%20Evolutionary%20Computing&rft.au=Drechsler,%20Nicole&rft.date=2004&rft.volume=3005&rft.spage=198&rft.epage=207&rft.pages=198-207&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540213783&rft.isbn_list=9783540213789&rft_id=info:doi/10.1007/978-3-540-24653-4_21&rft_dat=%3Cproquest_pasca%3EEBC3087929_28_217%3C/proquest_pasca%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540246534&rft.eisbn_list=3540246533&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=EBC3087929_28_217&rft_id=info:pmid/&rfr_iscdi=true |