中文版 | English

在结果中检索

CSpace

浏览/检索结果: 共9条，第1-9条 帮助

已选(0)清除 条数/页：   排序方式：
A full-scale solution to the rectilinear obstacle-avoiding Steiner problem 期刊论文
INTEGRATION-THE VLSI JOURNAL, 2008, 卷号: 41, 期号: 3, 页码: 413-425
作者:  Jing, Tom Tong;  Hu, Yu;  Feng, Zhe;  Hong, Xian-Long;  Hu, Xiaodong;  Yan, Guiying
收藏  |  浏览/下载：128/0  |  提交时间：2018/07/30
routing  rectilinear Steiner minimal tree  obstacle avoiding  ant colony optimization  track graph  hypergraph  full Steiner tree  detour  
lambda-OAT: lambda-geometry obstacle-avoiding tree construction with o (n log n) complexity 期刊论文
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2007, 卷号: 26, 期号: 11, 页码: 2073-2079
作者:  Jing, Tom Tong;  Feng, Zhe;  Hu, Yu;  Hong, Xianlong L.;  Hu, Xiaodong D.;  Yan, Guiying Y.
收藏  |  浏览/下载：131/0  |  提交时间：2018/07/30
Index Terms-Physical design  routing  Steiner tree  very large scale  integration (VLSI).  
A routing paradigm with novel resources estimation and routability models for X-Architecture based physical design 期刊论文
EMBEDDED COMPUTER SYSTEMS: ARCHITECTURES, MODELING, AND SIMULATION, 2005, 卷号: 3553, 页码: 344-353
作者:  Hu, Y;  Jing, T;  Hong, XL;  Hu, XD;  Yan, GY
收藏  |  浏览/下载：113/0  |  提交时间：2018/07/30
An efficient low-degree RMST algorithm for VLSI/ULSI physical design 期刊论文
INTEGRATED CIRCUIT AND SYSTEM DESIGN, 2004, 卷号: 3254, 页码: 442-452
作者:  Wang, Y;  Hong, XL;  Jing, T;  Yang, Y;  Hu, XD;  Yan, GY
收藏  |  浏览/下载：116/0  |  提交时间：2018/07/30
Approximations for Steiner trees with minimum number of Steiner points 期刊论文
THEORETICAL COMPUTER SCIENCE, 2001, 卷号: 262, 期号: 1-2, 页码: 83-99
作者:  Chen, DH;  Du, DZ;  Hu, XD;  Lin, GH;  Wang, LS;  Xue, GL
收藏  |  浏览/下载：134/0  |  提交时间：2018/07/30
Steiner trees  approximation algorithms  VLSI design  WDM optical networks  
Wire segmenting for buffer insertion based on RSTP-MSP 期刊论文
THEORETICAL COMPUTER SCIENCE, 2001, 卷号: 262, 期号: 1-2, 页码: 257-267
作者:  Lu, B;  Gu, J;  Hu, XD;  Shragowitz, E
收藏  |  浏览/下载：116/0  |  提交时间：2018/07/30
VLSI  wire segment  buffer insertion  rectilinear Steiner tree  minimum spanning tree  approximation algorithm  
Steiner tree problem with minimum number of Steiner points and bounded edge-length 期刊论文
INFORMATION PROCESSING LETTERS, 1999, 卷号: 69, 期号: 2, 页码: 53-57
作者:  Lin, GH;  Xue, GL
收藏  |  浏览/下载：96/0  |  提交时间：2018/07/30
algorithms  approximation algorithms  Steiner minimum trees  VLSI design  WDM optimal networks  wireless communications  
On the optimal four-way switch box routing structures of FPGA greedy routing architectures 期刊论文
INTEGRATION-THE VLSI JOURNAL, 1998, 卷号: 25, 期号: 2, 页码: 137-159
作者:  Pan, JF;  Wu, YL;  Wong, CK;  Yan, GY
收藏  |  浏览/下载：133/0  |  提交时间：2018/07/30
FPGA routing architecture  
A VLSI DESIGN FOR COMPUTING EXPONENTIATIONS IN GF(2M) AND ITS APPLICATION TO GENERATE PSEUDORANDOM NUMBER SEQUENCES 期刊论文
IEEE TRANSACTIONS ON COMPUTERS, 1990, 卷号: 39, 期号: 2, 页码: 258-262
作者:  WANG, CC;  PEI, D
收藏  |  浏览/下载：80/0  |  提交时间：2018/07/30