425 search results - page 25 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
ATMOS
2007
13 years 10 months ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
INFOCOM
2010
IEEE
13 years 7 months ago
2010
IEEE
In this paper we show that complex (scale-free) network topologies naturally emerge from hyperbolic metric spaces. The hyperbolic geometry can be used to facilitate maximally efï¬...
OSDI
2006
ACM
14 years 9 months ago
2006
ACM
We present the design, implementation, and evaluation of a fully distributed directory service for Farsite, a logically centralized file system that is physically implemented on a...
ICDE
2009
IEEE
14 years 10 months ago
2009
IEEE
In recent years, the data management community has begun to consider situations in which data access is closely tied to network routing and distributed acquisition: examples includ...
TKDE
2010
13 years 7 months ago
2010
— The data management community has recently begun to consider declarative network routing and distributed acquisition: e.g., sensor networks that execute queries about contiguou...