完整後設資料紀錄
| DC 欄位 | 值 | 語言 |
|---|---|---|
| dc.contributor.author | 詹, 景裕 Jr | |
| dc.contributor.author | 李, 明哲 Jr | |
| dc.contributor.author | 李, 欣冀 Jr | |
| dc.contributor.author | 呂, 紹偉 Jr | |
| dc.date.accessioned | 2011-03-24T19:57:26Z | |
| dc.date.accessioned | 2020-05-18T03:24:21Z | - |
| dc.date.available | 2011-03-24T19:57:26Z | |
| dc.date.available | 2020-05-18T03:24:21Z | - |
| dc.date.issued | 2011-03-24T19:57:26Z | |
| dc.date.submitted | 2009-11-27 | |
| dc.identifier.uri | http://dspace.lib.fcu.edu.tw/handle/2377/30080 | - |
| dc.description.abstract | In an X-Grid, a Multiple Steiner Trees Routing algorithm connects each group node via vertical, horizontal and oblique segments. So far the researches in this topic are few since the problem is NP-complete. The Multiple Steiner Trees Routing algorithm can be used to solve many well-known problems, such as the VDDGND routing problem in VLSI. This paper presents a novel Multiple Steiner Trees Routing algorithm, which adopts 4-geometry Steiner Trees Routing Heuristic algorithm to connect each group. The space and time complexities are O(pN) and O(p2N), respectively, where N is the number of nodes in the 2-D matrix and p is the number of terminal nodes, q is the number of groups. | |
| dc.description.sponsorship | National Taipei University,Taipei | |
| dc.format.extent | 7p. | |
| dc.relation.ispartofseries | NCS 2009 | |
| dc.subject | Multiple | |
| dc.subject | Steiner Trees | |
| dc.subject | Routing | |
| dc.subject.other | Workshop on Computer Architectures, Embedded Systems and VLSI/EDA | |
| dc.title | A Multiple Steiner Trees Routing Algorithm | |
| dc.title.alternative | 多組史坦納樹演算法 | |
| 分類: | 2009年 NCS 全國計算機會議 | |
文件中的檔案：
| 檔案 | 描述 | 大小 | 格式 | |
|---|---|---|---|---|
| CEV 2-1.pdf | 521.18 kB | Adobe PDF | 檢視/開啟 |
在 DSpace 系統中的文件，除了特別指名其著作權條款之外，均受到著作權保護，並且保留所有的權利。