390 search results - page 17 / 78 » Computing shortest paths for any number of hops |
95
Voted
CN
2006
15 years 1 months ago
2006
We first study the distribution of path duration in multi-hop wireless networks. We show that as the number of hops along a path increases, the path duration distribution can be a...
206
click to vote
SIGMOD
2009
ACM
16 years 2 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
132
Voted
CCR
2002
15 years 1 months ago
2002
In Differentiated Service (DiffServ) networks, the routing algorithms used by the premium class traffic, due to the high priority afforded to that traffic, may have a significant ...
149
click to vote
PUK
2003
15 years 3 months ago
2003
This paper exploits the spatial representation of state space problem graphs to preprocess and enhance heuristic search engines. It combines classical AI exploration with computati...
112
Voted
CONEXT
2005
ACM
15 years 3 months ago
2005
ACM
Dynamic networks appear in several contexts: QoS routing faces the difficult problem of accurately and efficiently maintaining, distributing and updating network state information...