National Tsing Hua University Institutional Repository:An Efficient Channel Routing Algorithm to Yield an Optimal Solution
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 54367/62174 (87%)
造访人次 : 15037284      在线人数 : 79
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 期刊論文  >  An Efficient Channel Routing Algorithm to Yield an Optimal Solution


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80808


    题名: An Efficient Channel Routing Algorithm to Yield an Optimal Solution
    作者: Wang, J. S.;Lee, R. C. T.
    教師: 李家同
    日期: 1990
    出版者: Institute of Electrical and Electronics Engineers
    關聯: IEEE TRANSACTIONS ON COMPUTERS, Institute of Electrical and Electronics Engineers, Volume 39, Issue 7, JUL 1990, Pages 957-962
    关键词: Algorithm
    摘要: An algorithm known as optimal channel routing (OCR) is proposed which finds an optimal solution for the channel routing problem in VLSI design. The algorithm is an A* algorithm with good heuristics and dominance rules for terminating unnecessary nodes in the searching tree. Experimental results, agreeing with theoretical analysis, show that it behaves quite well in average cases. An optimal solution is obtained for the Deutsch difficult case in 5.5-min-CPU time after the algorithm is implemented in Pascal and run on a VAX 11/750 computer.
    相関连結: http://www.ieee.org/index.html
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80808
    显示于类别:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML911检视/开启


    在NTHUR中所有的資料項目都受到原著作權保護,僅提供學術研究及教育使用,敬請尊重著作權人之權益。若須利用於商業或營利,請先取得著作權人授權。
    若發現本網站收錄之內容有侵害著作權人權益之情事,請權利人通知本網站管理者(smluo@lib.nthu.edu.tw),管理者將立即採取移除該內容等補救措施。

    SFX Query

    與系統管理員聯絡

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