Sciweavers

1017 search results - page 88 / 204
» A routing algorithm for flip-chip design
Sort
View
GCC
2003
Springer
14 years 2 months ago
Improving Topology-Aware Routing Efficiency in Chord
Due to their minimum consideration to an actual network topology, the existing peer-to-peer (P2P) overlay networks will lead to high latency and low efficiency. In TaChord, we pres...
Dongfeng Chen, Shoubao Yang
JAIR
2002
106views more  JAIR 2002»
13 years 8 months ago
Collective Intelligence, Data Routing and Braess' Paradox
We consider the problem of designing the the utility functions of the utility-maximizing agents in a multi-agent system (MAS) so that they work synergistically to maximize a globa...
David Wolpert, Kagan Tumer
EWSN
2004
Springer
14 years 8 months ago
ACE: An Emergent Algorithm for Highly Uniform Cluster Formation
The efficient subdivision of a sensor network into uniform, mostly non-overlapping clusters of physically close nodes is an important building block in the design of efficient uppe...
Haowen Chan, Adrian Perrig
ICCAD
2006
IEEE
105views Hardware» more  ICCAD 2006»
14 years 5 months ago
An optimal simultaneous diode/jumper insertion algorithm for antenna fixing
As technology enters the nanometer territory, the antenna effect plays an important role in determining the yield and reliability of a VLSI circuit. Diode insertion and jumper in...
Zhe-Wei Jiang, Yao-Wen Chang
DAC
2003
ACM
14 years 10 months ago
Improved global routing through congestion estimation
In this paper, we present a new method to improve global routing results. By using an amplified congestion estimate to influence a rip-up and reroute approach, we obtain substanti...
Raia Hadsell, Patrick H. Madden