410 search results - page 23 / 82 » Upgrading Shortest Paths in Networks |
134
click to vote
SENSYS
2003
ACM
15 years 6 months ago
2003
ACM
We present a technique for compression of shortest paths routing tables for wireless ad hoc networks. The main characteristic of such networks is that geographic location of nodes...
105
click to vote
ICHIT
2009
Springer
15 years 8 months ago
2009
Springer
Discovering the AS paths between two ASes are invaluable for a wide area of network research and application activities. The traditional techniques for path discovery require dire...
104
click to vote
COSIT
1995
Springer
15 years 5 months ago
1995
Springer
: Various algorithms have been proposed for the determination of the optimum paths in line networks. Moving in space is a far more complex problem, where research has been scarce. ...
143
click to vote
GSN
2009
Springer
15 years 5 months ago
2009
Springer
En-route data compression is fundamental to reduce the power consumed for data gathering in sensor networks. Typical in-network compression schemes involve the distributed computat...
103
click to vote
WEA
2007
Springer
15 years 7 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...