85 search results - page 3 / 17 » Landmark-Based Routing in Dynamic Graphs |
WICON
2008
13 years 9 months ago
2008
Cognitive radio networks that allow dynamic spectrum access are considered spectrally more efficient than networks using fixed spectral allocation. These networks are characterize...
TALG
2008
13 years 7 months ago
2008
NCA
2007
IEEE
14 years 2 months ago
2007
IEEE
The assessment of routing protocols for wireless networks is a difficult task, because of the networks’ highly dynamic behavior and the absence of benchmarks. However, some of ...
ATMOS
2009
13 years 9 months ago
2009
Abstract. Computation of quickest paths has undergoing a rapid development in recent years. It turns out that many high-performance route planning algorithms are made up of several...
ISI
2007
Springer
14 years 2 months ago
2007
Springer
—We address the problem of planning patrol routes to maximize coverage of important locations (hot spots) at minimum cost (length of patrol route). We model a road network using ...