Sciweavers

3678 search results - page 136 / 736
» On the Stable Paths Problem
Sort
View
STOC
2007
ACM
109views Algorithms» more  STOC 2007»
16 years 1 months ago
Stability of the max-weight routing and scheduling protocol in dynamic networks and at critical loads
We study the stability of the Max-Weight protocol for combined routing and scheduling in communication networks. Previous work has shown that this protocol is stable for adversari...
Matthew Andrews, Kyomin Jung, Alexander L. Stolyar
MCS
2009
Springer
15 years 7 months ago
True Path Rule Hierarchical Ensembles
Abstract. Hierarchical classification problems gained increasing attention within the machine learning community, and several methods for hierarchically structured taxonomies have...
Giorgio Valentini
INFOCOM
2009
IEEE
15 years 7 months ago
Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
Satyajayant Misra, Guoliang Xue, Dejun Yang
ESA
2009
Springer
146views Algorithms» more  ESA 2009»
15 years 7 months ago
Kernel Bounds for Disjoint Cycles and Disjoint Paths
In this paper, we give evidence for the problems Disjoint Cycles and Disjoint Paths that they cannot be preprocessed in polynomial time such that resulting instances always have a ...
Hans L. Bodlaender, Stéphan Thomassé...
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
15 years 4 months ago
RRT-Connect: An Efficient Approach to Single-Query Path Planning
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
James J. Kuffner Jr., Steven M. LaValle