487 search results - page 47 / 98 » Routing in Outer Space |
179
click to vote
WEA
2007
Springer
16 years 12 days ago
2007
Springer
Many speed-up techniques for route planning in static graphs exist, only few of them are proven to work in a dynamic scenario. Most of them use preprocessed information, which has ...
157
click to vote
ICALP
2001
Springer
15 years 10 months ago
2001
Springer
Given an undirected graph with positive edge weights, define Nq(v) for each node v to be the set of q nodes closest to v (including v itself and breaking ties by node ID). It is ...
174
click to vote
ISCC
2000
IEEE
15 years 10 months ago
2000
IEEE
With standard assumptions the routing and wavelength assignment problem (RWA) can be viewed as a Markov Decision Process (MDP). The problem, however, defies an exact solution bec...
153
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
We propose a novel optimization scheme that can improve the routing by reducing a newly observed router decaying effect. A pair of greedy-grow algorithms, each emphasizing a diffe...
171
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We consider a dynamic vehicle routing problem in wireless networks where messages arriving randomly in time and space are collected by a mobile receiver (vehicle or a collector). ...