淡江大學機構典藏:Item 987654321/38835
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 62805/95882 (66%)
造访人次 : 3885941      在线人数 : 575
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜寻范围 查询小技巧：
  • 您可在西文检索词汇前后加上"双引号"，以获取较精准的检索结果
  • 若欲以作者姓名搜寻，建议至进阶搜寻限定作者字段，可获得较完整数据
    •  进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/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 PDF604检视/开启
    index.html0KbHTML255检视/开启

    在機構典藏中所有的数据项都受到原著作权保护.

    TAIR相关文章

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