2796 search results - page 72 / 560 » The coolest path problem |
123
click to vote
ASPDAC
2012
ACM
13 years 9 months ago
2012
ACM
With technology scaling, integrated circuits behave more unpredictably due to process variation, environmental changes and aging effects. Various variation-aware and adaptive desi...
128
click to vote
STOC
2002
ACM
16 years 2 months ago
2002
ACM
We present improved algorithms for maintaining transitive closure and all-pairs shortest paths/distances in a digraph under deletion of edges. For the problem of transitive closur...
101
click to vote
GLOBECOM
2007
IEEE
15 years 8 months ago
2007
IEEE
— A fundamental problem in quality-of-service (QoS) routing is to find a path connecting a source node to a destination node that satisfies K ≥ 2 additive QoS constraints. Th...
119
click to vote
ASPDAC
2006
ACM
15 years 8 months ago
2006
ACM
− In this paper, we present a new timing-driven placement algorithm, which attempts to minimize zigzags and crisscrosses on the timing-critical paths of a circuit. We observed th...
150
click to vote
NETWORKS
2007
15 years 1 months ago
2007
Internet protocol (IP) traffic follows rules established by routing protocols. Shortest path based protocols, such as Open Shortest Path First (OSPF), direct traffic based on arc w...