Sciweavers

1017 search results - page 5 / 204
» A routing algorithm for flip-chip design
Sort
View
ICUIMC
2011
ACM
12 years 11 months ago
Overhead analysis of query localization optimization and routing
Query localization is an improved extension of on-demand routing protocols for ad hoc networks. It makes use of prior routing histories to localize the query flood to a limited re...
Wenzheng Xu, Yongmin Zhang, Weifa Liang
ICCAD
2009
IEEE
109views Hardware» more  ICCAD 2009»
13 years 5 months ago
CRISP: Congestion reduction by iterated spreading during placement
Dramatic progress has been made in algorithms for placement and routing over the last 5 years, with improvements in both speed and quality. Combining placement and routing into a ...
Jarrod A. Roy, Natarajan Viswanathan, Gi-Joon Nam,...
EJWCN
2010
119views more  EJWCN 2010»
13 years 2 months ago
Simulations of the Impact of Controlled Mobility for Routing Protocols
This paper addresses mobility control routing in wireless networks. Given a data flow request between a sourcedestination pair, the problem is to move nodes towards the best placem...
Valeria Loscrì, Enrico Natalizio, Carmelo C...
SAPIR
2004
Springer
14 years 25 days ago
Probabilistic Routing in Intermittently Connected Networks
We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at...
Anders Lindgren, Avri Doria, Olov Schelén
ICCAD
1994
IEEE
106views Hardware» more  ICCAD 1994»
13 years 11 months ago
On the NP-completeness of regular 2-D FPGA routing architectures and a novel solution
Several industrial FPGA routing architectures have been shown to have no efficient routing algorithms (unless P=NP) [3,4]. Here, we further investigate if the intractability of th...
Yu-Liang Wu, Douglas Chang