English  |  正體中文  |  简体中文  |  Items with full text/Total items : 49645/84944 (58%)
Visitors : 7698858      Online Users : 41
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/38835


    Title: ENISLE: an intuitive heuristic nearly optimal solution for mincut and ratio mincut partitioning
    Authors: Cheng, Shun-wen;Cheng, Kuo-hsing
    Contributors: 淡江大學電機工程學系
    Date: 2001-05
    Issue Date: 2010-04-15 11:38:14 (UTC+8)
    Publisher: Institute of Electrical and Electronics Engineers (IEEE)
    Abstract: Mincut partitioning is to minimize the total cuts of the edges by the partitioning of nodes into two sets. The proposed method, Edge-Node Interleaved Sort for Leaching and Envelop (ENISLE) algorithm, not only uses node information but also uses edge information. It is simple, but works effectively, and has never appeared in any earlier literature. It can soon obtain an intuitive heuristic nearly optimal solution for mincut and ratio mincut partitioning and, at the same time, is very suitable for EDA usage.
    Relation: Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on (Volume:5 ), pp.167-170
    DOI: 10.1109/ISCAS.2001.922011
    Appears in Collections:[電機工程學系暨研究所] 會議論文

    Files in This Item:

    File Description SizeFormat
    0780366859_5p167-170.pdf356KbAdobe PDF513View/Open
    index.html0KbHTML126View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback