390 search results - page 44 / 78 » Computing shortest paths for any number of hops |
100
click to vote
JIRS
2007
15 years 1 months ago
2007
— In this paper, we propose a novel path-planning and obstacle avoidance algorithm GODZILA for navigation in unknown environments. No prior knowledge of the environment is requir...
100
click to vote
MATES
2010
Springer
15 years 11 days ago
2010
Springer
Context-aware routing is the problem of finding the shortest route from a start location to a destination location while taking into account the planned movements of other agents...
119
click to vote
ALGORITHMICA
2005
15 years 1 months ago
2005
The current standard for intra-domain network routing, Open Shortest Path First (OSPF), suffers from a number of problems--the tunable parameters (the weights) are hard to optimiz...
132
Voted
WEBI
2005
Springer
15 years 7 months ago
2005
Springer
This work presents a new perspective on characterizing the similarity between elements of a database or, more generally, nodes of a weighted, undirected, graph. It is based on a M...
119
click to vote
EUROPAR
2004
Springer
15 years 7 months ago
2004
Springer
High scalability in Peer-to-Peer (P2P) systems has been achieved with the emergence of the networks based on Distributed Hash Table (DHT). Most of the DHTs can be regarded as expon...