A stochastic evolution algorithm for the graph covering problem and its application to the technology mapping
A stochastic evolution algorithm is applied to solve the graph covering problem in which a set of patterns that fully covers a subject graph with a minimal cost is sought. This problem is a typical constrained combinatorial optimization problem and is proven to be NP-complete. Many branch-and-bound...
Gespeichert in:
| Veröffentlicht in: | Proceedings of 1996 IEEE International Conference on Evolutionary Computation (ICEC '96): May 20-22, 1996, Symposion & Toyoda Auditorium, Nagoya University, Japan S. 475 - 479 |
|---|---|
| Hauptverfasser: | , , , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
1996
|
| Schlagworte: | |
| ISBN: | 9780780329027, 0780329023 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | A stochastic evolution algorithm is applied to solve the graph covering problem in which a set of patterns that fully covers a subject graph with a minimal cost is sought. This problem is a typical constrained combinatorial optimization problem and is proven to be NP-complete. Many branch-and-bound algorithms with different heuristics have been proposed but most of them cannot handle practical sized problems like the technology mapping problem from the VLSI synthesis area. Our stochastic evolution is based on a problem-specific encoding scheme to reduce the size of the search space and incorporates the tree matching algorithm at the initial solution generation stage for speed-up. Experimental results show that the proposed algorithm produces good solutions within a reasonable amount of time. |
|---|---|
| AbstractList | A stochastic evolution algorithm is applied to solve the graph covering problem in which a set of patterns that fully covers a subject graph with a minimal cost is sought. This problem is a typical constrained combinatorial optimization problem and is proven to be NP-complete. Many branch-and-bound algorithms with different heuristics have been proposed but most of them cannot handle practical sized problems like the technology mapping problem from the VLSI synthesis area. Our stochastic evolution is based on a problem-specific encoding scheme to reduce the size of the search space and incorporates the tree matching algorithm at the initial solution generation stage for speed-up. Experimental results show that the proposed algorithm produces good solutions within a reasonable amount of time. |
| Author | Cheol Hoon Park Hoon Choi Seung Ho Hwang Lae-Jeong Park Dae-Hyun Lee |
| Author_xml | – sequence: 1 surname: Dae-Hyun Lee fullname: Dae-Hyun Lee organization: Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Taejon, South Korea – sequence: 2 surname: Hoon Choi fullname: Hoon Choi organization: Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Taejon, South Korea – sequence: 3 surname: Lae-Jeong Park fullname: Lae-Jeong Park organization: Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Taejon, South Korea – sequence: 4 surname: Cheol Hoon Park fullname: Cheol Hoon Park organization: Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Taejon, South Korea – sequence: 5 surname: Seung Ho Hwang fullname: Seung Ho Hwang organization: Dept. of Electr. Eng., Korea Adv. Inst. of Sci. & Technol., Taejon, South Korea |
| BookMark | eNotkMFLwzAYxQMqqHN38ZR_oPVLvqRrjqNMHQy86HmkadJG2qakcbD_3rL5ePAOj987vEdyO4bREvLMIGcM1Ou-2lU5U6rIpeCF2NyQtdqUsBi5Ar65J-t5_oFFQkgs5AMZtnROwXR6Tt5Qewr9b_JhpLpvQ_SpG6gLkabO0jbqqaMmnGz0Y0unGOreDlSPDfVppnqaem_0BU7hQiRrujH0oT3TYakX6oncOd3Pdv2fK_L9tvuqPrLD5_u-2h4yz0CkzBa85tw5p5xERK0YMNEINAUXNWihDaDREpC5EpWoUUlQ2DQlZ6UCkLgiL9ddb609TtEPOp6P10_wD-UDWfI |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ICEC.1996.542647 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE/IET Electronic Library IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EndPage | 479 |
| ExternalDocumentID | 542647 |
| GroupedDBID | 6IE 6IK 6IL AAJGR AAWTH ACGHX ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK OCL RIE RIL |
| ID | FETCH-LOGICAL-i104t-e62b22fff9f5333a91014d43c624b0a4ac03ca5031f8394b395093dd821890053 |
| IEDL.DBID | RIE |
| ISBN | 9780780329027 0780329023 |
| ISICitedReferencesCount | 0 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=542647&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Tue Aug 26 17:28:10 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | false |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i104t-e62b22fff9f5333a91014d43c624b0a4ac03ca5031f8394b395093dd821890053 |
| PageCount | 5 |
| ParticipantIDs | ieee_primary_542647 |
| PublicationCentury | 1900 |
| PublicationDate | 19960000 |
| PublicationDateYYYYMMDD | 1996-01-01 |
| PublicationDate_xml | – year: 1996 text: 19960000 |
| PublicationDecade | 1990 |
| PublicationTitle | Proceedings of 1996 IEEE International Conference on Evolutionary Computation (ICEC '96): May 20-22, 1996, Symposion & Toyoda Auditorium, Nagoya University, Japan |
| PublicationTitleAbbrev | ICEC |
| PublicationYear | 1996 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0000445365 |
| Score | 1.2426689 |
| Snippet | A stochastic evolution algorithm is applied to solve the graph covering problem in which a set of patterns that fully covers a subject graph with a minimal... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 475 |
| SubjectTerms | Business continuity Encoding Heuristic algorithms Libraries Logic circuits Pattern matching Space technology Stochastic processes Tree graphs Very large scale integration |
| Title | A stochastic evolution algorithm for the graph covering problem and its application to the technology mapping |
| URI | https://ieeexplore.ieee.org/document/542647 |
| WOSCitedRecordID | wos542647&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NS8MwGA5uePA0nRO_eQ9eu9UmTZOjjA0FGTso7DbSfGwF18qW7febpN1U8OKtKSSEfPA-eT-eB6EHL2qVkzyLiDIiIiJmkeC5jhQTWCnutU4Cu_5rNpmw2YxPG57tUAujtQ7JZ7rvP0MsX1Vy611lg9Sb76yFWlmW1aVaB3dKTEiKaRoe5izGCXe2qOHX2bezfZQy5oOX4WjoC_Vovx7zl7ZKMC3jzr8mdYp63yV6MD0YnzN0pMsu6uw1GqC5sudo9QQO3sml8HzMoHfNSQPxsajWhV2uwKFWcCgQAnU1SJ_S6UaERmkGRKmgsBv4EekGW4Ue9uCWh5XwPA-LHnofj96Gz1EjsRAV7h1mI02TPEmMMdw43IcF99K9imBJE5LHgggZYy-agB-NQ1Ikx9wBDLeJzCED7i_wBWqXVakvEVBpFI8dAHOYk1AhmE4kMxw7yEMlTdUV6vrFm3_WLBrzet2u__x7g07q7Gjv6rhFbbve6jt0LHe22Kzvw85_AYETrGM |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT8IwGG4UTfSEIsZv34PXwVi7bj0agoGIhAMm3EjXD1gim4HB77ftBmrixdu6pE3Tj7xP34_nQejJilolJIk8IjX3CPdjj7NEeTLmWEpmtU4cu_4wGo3i6ZSNK55tVwujlHLJZ6plP10sX-ZiY11l7dCa7-gQHYWEBJ2yWGvvUPEJCTEN3dM89nHAjDWqGHZ27WgXp_RZe9DtdW2pHm2Vo_5SV3HG5aX-r2mdoeZ3kR6M9-bnHB2orIHqO5UGqC7tBVo-gwF4YsEtIzOobXXWgH_M81VaLJZgcCsYHAiOvBqETeo0I0KlNQM8k5AWa_gR64Yidz2KvWMeltwyPcyb6P2lN-n2vUpkwUvNS6zwFA2SINBaM22QH-bMivdKggUNSOJzwoWPrWwC7miDpUiCmYEYZhtjgw2YvcKXqJblmbpCQIWWzDcQzKBOQjmPVSBizbABPVTQUF6jhl282WfJozEr1-3mz7-P6KQ_eRvOhoPR6y06LXOlrePjDtWK1Ubdo2OxLdL16sGdgi-npK-q |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+of+1996+IEEE+International+Conference+on+Evolutionary+Computation+%28ICEC+%2796%29%3A+May+20-22%2C+1996%2C+Symposion+%26+Toyoda+Auditorium%2C+Nagoya+University%2C+Japan&rft.atitle=A+stochastic+evolution+algorithm+for+the+graph+covering+problem+and+its+application+to+the+technology+mapping&rft.au=Dae-Hyun+Lee&rft.au=Hoon+Choi&rft.au=Lae-Jeong+Park&rft.au=Cheol+Hoon+Park&rft.date=1996-01-01&rft.pub=IEEE&rft.isbn=9780780329027&rft.spage=475&rft.epage=479&rft_id=info:doi/10.1109%2FICEC.1996.542647&rft.externalDocID=542647 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780329027/lc.gif&client=summon&freeimage=true |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780329027/mc.gif&client=summon&freeimage=true |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780780329027/sc.gif&client=summon&freeimage=true |