Sciweavers

2796 search results - page 30 / 560
» The coolest path problem
Sort
View
TON
2002
99views more  TON 2002»
14 years 11 months ago
Computing shortest paths for any number of hops
In this paper we introduce and investigate a new" path optimization problem which we denote as the All Hops Optimal Path AHOP problem. The problem involves identifying, for a...
Roch Guérin, Ariel Orda
ISPD
2009
ACM
127views Hardware» more  ISPD 2009»
15 years 6 months ago
Synthesizing a representative critical path for post-silicon delay prediction
Several approaches to post-silicon adaptation require feedback from a replica of the nominal critical path, whose variations are intended to reflect those of the entire circuit a...
Qunzeng Liu, Sachin S. Sapatnekar
IFIP
2009
Springer
15 years 6 months ago
A Distributed Exact Solution to Compute Inter-domain Multi-constrained Paths
The fundamental Quality of Service (QoS) routing problem, which consists in determining paths subject to multiple QoS constraints, has been extensively investigated in the intra-do...
Gilles Bertrand, Samer Lahoud, Géraldine Te...
IWPEC
2009
Springer
15 years 6 months ago
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms
We study the parameterized complexity of two families of problems: the bounded length disjoint paths problem and the bounded length cut problem. From Menger’s theorem both proble...
Petr A. Golovach, Dimitrios M. Thilikos
NOSSDAV
2004
Springer
15 years 5 months ago
Managing a portfolio of overlay paths
In recent years, several architectures have been proposed and developed for supporting streaming applications that take advantage of multiple paths through the network simultaneou...
Daria Antonova, Arvind Krishnamurthy, Zheng Ma, Ra...