88 search results - page 8 / 18 » A new approach to dynamic all pairs shortest paths |
92
Voted
JSAC
2006
14 years 11 months ago
2006
As networks grow in size and complexity, both the probability and the impact of failures increase. The pre-allocated backup bandwidth, which has been widely investigated in the lit...
ICRA
2009
IEEE
15 years 6 months ago
2009
IEEE
— We consider the problem of tracking multiple agents moving amongst obstacles, using multiple cameras. Given an environment with obstacles, and many people moving through it, we...
AAAI
2000
15 years 1 months ago
2000
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
SENSYS
2006
ACM
15 years 5 months ago
2006
ACM
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
115
click to vote
VLDB
2001
ACM
15 years 4 months ago
2001
ACM
With the advent of XML as a standard for data representation and exchange on the Internet, storing and querying XML data becomes more and more important. Several XML query languag...