244 search results - page 1 / 49 » Algorithmic Techniques for Maintaining Shortest Routes in Dy... |
ENTCS
2007
13 years 4 months ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
TKDE
2010
13 years 3 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...
NIPS
1993
13 years 6 months ago
1993
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning module is embedded into each node of a switching network. Only local communicati...
ALGORITHMICA
1998
13 years 4 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
CNSR
2010
IEEE
13 years 8 months ago
2010
IEEE
—MANET routing protocols are designed to scale up to thousands of routers with frequent changes of the topology. In preference, MANET routing protocols should also support constr...