Sciweavers

540 search results - page 43 / 108
» Competitive Routing over Time
Sort
View
IPPS
2006
IEEE
14 years 4 months ago
Reducing reconfiguration time of reconfigurable computing systems in integrated temporal partitioning and physical design framew
In reconfigurable systems, reconfiguration latency is a very important factor impact the system performance. In this paper, a framework is proposed that integrates the temporal pa...
Farhad Mehdipour, Morteza Saheb Zamani, H. R. Ahma...
VLSID
2002
IEEE
92views VLSI» more  VLSID 2002»
14 years 10 months ago
Electromigration Avoidance in Analog Circuits: Two Methodologies for Current-Driven Routing
Interconnect with an insufficient width may be subject to electromigration and eventually cause the failure of the circuit at any time during its lifetime. This problem has gotten...
Jens Lienig, Goeran Jerke, Thorsten Adler
SIGCOMM
1997
ACM
14 years 2 months ago
Scalable High Speed IP Routing Lookups
Internet address lookup is a challenging problem because of increasing routing table sizes, increased traffic, higher speed links, and the migration to 128 bit IPv6 addresses. IP...
Marcel Waldvogel, George Varghese, Jonathan S. Tur...
NETWORKING
2010
13 years 11 months ago
Efficient Recovery from False State in Distributed Routing Algorithms
Abstract--Malicious and misconfigured nodes can inject incorrect state into a distributed system, which can then be propagated system-wide as a result of normal network operation. ...
Daniel Gyllstrom, Sudarshan Vasudevan, Jim Kurose,...
IJCV
2008
146views more  IJCV 2008»
13 years 10 months ago
Scanning Depth of Route Panorama Based on Stationary Blur
This work achieves an efficient acquisition of scenes and their depths along long streets. A camera is mounted on a vehicle moving along a straight or a mildly curved path and a sa...
Jiang Yu Zheng, Min Shi