425 search results - page 21 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
ICANNGA
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
CAV
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we show how the classical job-shop scheduling problem can be modeled as a special class of acyclic timed automata. Finding an optimal schedule corresponds, then, to n...
INFOCOM
2002
IEEE
14 years 1 months ago
2002
IEEE
—In MPLS/GMPLS networks, a range of restoration schemes will be required to support different tradeoffs between service interruption time and network resource utilization. In lig...
ICOIN
2001
Springer
14 years 1 months ago
2001
Springer
This paper investigates the problem of path calcul ation of multiple metric routing. Toda ’s Internet routing is based on a single metric path selecting algorithm. Single metric...
EDBTW
2006
Springer
14 years 11 days ago
2006
Springer
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...