English  |  正體中文  |  简体中文  |  Items with full text/Total items : 54367/62174 (87%)
Visitors : 14936279      Online Users : 149
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTHU 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
    National Tsing Hua University Institutional Repository > 歷任校長 > 李家同 (1993-1994) > 期刊論文  >  An Efficient Channel Routing Algorithm to Yield an Optimal Solution

    Please use this identifier to cite or link to this item: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80808

    Title: An Efficient Channel Routing Algorithm to Yield an Optimal Solution
    Authors: Wang, J. S.;Lee, R. C. T.
    教師: 李家同
    Date: 1990
    Publisher: Institute of Electrical and Electronics Engineers
    Relation: IEEE TRANSACTIONS ON COMPUTERS, Institute of Electrical and Electronics Engineers, Volume 39, Issue 7, JUL 1990, Pages 957-962
    Keywords: Algorithm
    Abstract: 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.
    Relation Link: http://www.ieee.org/index.html
    URI: http://nthur.lib.nthu.edu.tw/dspace/handle/987654321/80808
    Appears in Collections:[李家同 (1993-1994)] 期刊論文
    [資訊工程學系] 期刊論文

    Files in This Item:

    File SizeFormat


    SFX Query


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