Sciweavers

953 search results - page 14 / 191
» A Heuristic for Channel Routing
Sort
View
ASPDAC
2004
ACM
114views Hardware» more  ASPDAC 2004»
14 years 1 months ago
Layer assignment for crosstalk risk minimization
— In ultra-deep submicron technology, crosstalk noise is so severe that crosstalk avoidance merely in detailed routing is not adequate and it has to be considered in earlier desi...
Di Wu, Jiang Hu, Rabi N. Mahapatra, Min Zhao
ASPDAC
2005
ACM
158views Hardware» more  ASPDAC 2005»
13 years 9 months ago
The polygonal contraction heuristic for rectilinear Steiner tree construction
— Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (...
Yin Wang, Xianlong Hong, Tong Jing, Yang Yang, Xia...
GIS
2008
ACM
13 years 8 months ago
Heuristic algorithms for route-search queries over geographical data
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
Yaron Kanza, Eliyahu Safra, Yehoshua Sagiv, Yerach...
FPGA
2008
ACM
131views FPGA» more  FPGA 2008»
13 years 9 months ago
WireMap: FPGA technology mapping for improved routability
This paper presents a new technology mapper, WireMap. The mapper uses an edge flow heuristic to improve the routability of a mapped design. The heuristic is applied during the ite...
Stephen Jang, Billy Chan, Kevin Chung, Alan Mishch...
CONEXT
2005
ACM
13 years 9 months ago
MRS: a simple cross-layer heuristic to improve throughput capacity in wireless mesh networks
Wireless Mesh Networks (WMNs) are an emerging architecture based on multi-hop transmission. ISPs considers WMNs as a potential future technology to offer broadband Internet acces...
Luigi Iannone, Serge Fdida