85 search results - page 7 / 17 » Landmark-Based Routing in Dynamic Graphs |
TVCG
2008
13 years 7 months ago
2008
We present a novel approach for efficient path planning and navigation of multiple virtual agents in complex dynamic scenes. We introduce a new data structure, Multiagent Navigatio...
SIGCOMM
2004
ACM
14 years 14 days ago
2004
ACM
We formulate the delay-tolerant networking routing problem, where messages are to be moved end-to-end across a connectivity graph that is time-varying but whose dynamics may be kn...
ECBS
2008
IEEE
14 years 1 months ago
2008
IEEE
Network designers perform challenging tasks with so many configuration options that it is often hard or even impossible for a human to predict all potentially dangerous situation...
GCC
2005
Springer
14 years 17 days ago
2005
Springer
Building a topology-aware peer-to-peer overlay network can bring many advantages, such as providing locality-aware connectivity and reducing routing path length. While its benefit...
USITS
2003
13 years 8 months ago
2003
straction. TESLA services can be deployed transparently using dynamic library interposition and can be composed by chaining event handlers in a graph structure. We show how TESLA c...