552 search results - page 65 / 111 » Constrained Shortest Path Computation |
214
click to vote
GIS
2007
ACM
16 years 2 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
105
Voted
MASCOTS
2004
15 years 2 months ago
2004
One of the primary challenges facing scalable network emulation and simulation is the overhead of storing network-wide routing tables or computing appropriate routes on a per-pack...
101
click to vote
MST
2002
15 years 1 months ago
2002
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
122
Voted
AINA
2008
IEEE
15 years 8 months ago
2008
IEEE
In intermittently connected ad hoc networks standard routing protocols like AODV, DSR and GPSR fail since they generally cannot find a contemporaneous path from source to destinat...
100
click to vote
EUROPAR
2007
Springer
15 years 7 months ago
2007
Springer
The IEEE 802.16 mobile multi-hop relay (MMR) task group ’j’ (TGj) has recently introduced the multi-hop relaying concept in the IEEE 802.16 WirelessMAN, wherein a newly introdu...