77 search results - page 9 / 16 » Timing optimization by restructuring long combinatorial path... |
JNW
2008
13 years 7 months ago
2008
Position based routing algorithms use the knowledge of the position of nodes for routing of packets in mobile ad-hoc networks. Previously proposed position based routing algorithms...
ICMCS
2005
IEEE
14 years 1 months ago
2005
IEEE
The loss and delay experienced by packets travelling along an Internet network path are mainly governed by the characteristics of a bottleneck link, such as available data rate an...
COLT
2004
Springer
14 years 24 days ago
2004
Springer
We give an algorithm for the bandit version of a very general online optimization problem considered by Kalai and Vempala [1], for the case of an adaptive adversary. In this proble...
ICCAD
2006
IEEE
14 years 4 months ago
2006
IEEE
Abstract— Design variability due to within-die and die-todie process variations has the potential to significantly reduce the maximum operating frequency and the effective yield...
EDCC
2008
Springer
13 years 9 months ago
2008
Springer
Under the hypothesis of single failures in the network, some backup paths cannot be active at the same time because they protect against the failure of different components. Hence...