55 search results - page 7 / 11 » Engineering Fast Route Planning Algorithms |
SIGCOMM
2005
ACM
14 years 2 months ago
2005
ACM
Hash table is used as one of the fundamental modules in several network processing algorithms and applications such as route lookup, packet classification, per-flow state manage...
ICDCS
1999
IEEE
14 years 26 days ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
SLS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. In this paper, a real-life routing and scheduling problem encountered is addressed. The problem, which consists in optimizing the delivery of fluids by tank trucks on a ...
IJRR
2011
13 years 3 months ago
2011
We present a novel approach to legged locomotion over rough terrain that is thoroughly rooted in optimization. This approach relies on a hierarchy of fast, anytime algorithms to p...
AIPS
2009
13 years 9 months ago
2009
Dynamic plan execution strategies allow an autonomous agent to respond to uncertainties while improving robustness and reducing the need for an overly conservative plan. Executive...