English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 51772/86996 (60%)
造訪人次 : 8371107      線上人數 : 54
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/38835


    題名: ENISLE: an intuitive heuristic nearly optimal solution for mincut and ratio mincut partitioning
    作者: Cheng, Shun-wen;Cheng, Kuo-hsing
    貢獻者: 淡江大學電機工程學系
    日期: 2001-05
    上傳時間: 2010-04-15 11:38:14 (UTC+8)
    出版者: Institute of Electrical and Electronics Engineers (IEEE)
    摘要: 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.
    關聯: Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on (Volume:5 ), pp.167-170
    DOI: 10.1109/ISCAS.2001.922011
    顯示於類別:[電機工程學系暨研究所] 會議論文

    文件中的檔案:

    檔案 描述 大小格式瀏覽次數
    0780366859_5p167-170.pdf356KbAdobe PDF515檢視/開啟
    index.html0KbHTML130檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

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