Sciweavers

1017 search results - page 64 / 204
» A routing algorithm for flip-chip design
Sort
View
HOTNETS
2010
13 years 3 months ago
Packet re-cycling: eliminating packet losses due to network failures
This paper presents Packet Re-cycling (PR), a technique that takes advantage of cellular graph embeddings to reroute packets that would otherwise be dropped in case of link or nod...
Suksant Sae Lor, Raul Landa, Miguel Rio
INFOCOM
2012
IEEE
11 years 11 months ago
HAWK: An unmanned mini helicopter-based aerial wireless kit for localization
—This paper presents a fully functional and highly portable mini Unmanned Aerial Vehicle (UAV) system, HAWK, for conducting aerial localization. HAWK is a programmable mini helic...
Zhongli Liu, Yinjie Chen, Benyuan Liu, Chengyu Cao...
IPPS
1997
IEEE
14 years 1 months ago
Nearly Optimal One-To-Many Parallel Routing in Star Networks
Star networks were proposedrecently as an attractive alternative to the well-known hypercube models for interconnection networks. Extensive research has been performed that shows ...
Chi-Chang Chen, Jianer Chen
ICCAD
2007
IEEE
64views Hardware» more  ICCAD 2007»
14 years 5 months ago
A simultaneous bus orientation and bused pin flipping algorithm
— The orientation of a bus is defined as the direction from the Least Significant Bit (LSB) to the Most Significant Bit (MSB). Bused pin flipping is a property that allows severa...
Fan Mo, Robert K. Brayton
DAC
2006
ACM
14 years 9 months ago
Circuit simulation based obstacle-aware Steiner routing
Steiner routing is a fundamental yet NP-hard problem in VLSI design and other research fields. In this paper, we propose to model the routing graph by an RC network with routing t...
Yiyu Shi, Paul Mesa, Hao Yu, Lei He