教師著作
Permanent URI for this collectionhttp://rportal.lib.ntnu.edu.tw/handle/20.500.12235/31276
Browse
8 results
Search Results
Item On Transformation of Logic Specifications into Procedural Programs(IEEE, 1989-10-23) Lin, Janet Mei-Chuen; Juang, Jie-Yong; Yau, Stephen SA method for transforming a source program expressed as a set of Horn clauses into a target program in an Algol-like procedural language is presented. Compared with deterministic execution of a conventional program, the top-down procedural interpretation of a Horn clause program is inherently nondeterministic. This transformation method is aimed at removing certain types of nondeterministic in a Horn clause program via a variable-dependence analysis and a procedure formation scheme. It is assumed that the input/output mode information for each predicate in the Horn clause is known in advance and that each predicate is used unidirectionally, i.e. each argument in the argument list of a predicate is used either as an input or an output, but not both. Therefore, the Horn clauses treated by this method represent only a subclass of the general Horn logic clauses. During the transformation process, the method is also capable of discovering inconsistent or missing information in the source program.Item A new dynamic switch-box router(1987-12-01) 張國恩; 馮武雄; Chang, Kuo-En; Feng Wu-ShiungItem An efficient layer assignment for three-layer VLSI routing(1989-09-01) 張國恩; 馮武雄; Fang, S. C.; Chang, Kuo-En; Feng Wu-Shiung; Fang, Sung-ChuanItem Top-Down Placement for Hierarchical Layout System(1986-08-01) 張國恩; 馮武雄; Chang, Kuo-En; Feng, Wu-ShiungItem The Topological Order Determination for Three-Layer Channel Routing Problem(1988-01-01) 張國恩; Lai, T. H.; 馮武雄; Chang, Kuo-En; Lai, T. H.; Feng Wu-ShiungItem The pin alignment in VLSI routing with movable terminals(1989-01-01) 張國恩; 馮武雄; Yu, H. J.; Chang, Kuo-En; Feng Wu-Shiung; Yu, H. J.Item Constrained via minimization for three-layer routing(Elsevier, 1989-07-01) Chang, K. E.; Jyu, H. F.; Feng, W. S.The previous constrained via minimization problem for VLSI previous three-layer routing is the problem of deining which previous layers can be used for previous routing the wire segments in the interconnections of nets so that the number of previous vias is minimized. This problem has been shown to be NP-complete15. In this paper, this problem is first transformed to the contractibility problem of a previous three -colourable graph, then an heuristic algorithm is proposed on the basis of the graph contractability model. From experimental results, the algorithm proves faster and more efficient at generating very good results. For a typical case, the number of previous vias can be reduced by about 30%.Item 有關VLSI佈局層指定的圖形縮減問題(中國工程師學會, 1989-07-01) 張國恩; 鞠鴻飛; 馮武雄; Chang, K. E.; Jyu, H. F.; Feng, W. S.