473 search results - page 70 / 95 » Computing shortest paths with uncertainty |
84
Voted
GIS
2002
ACM
14 years 9 months ago
2002
ACM
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
OPODIS
2008
14 years 11 months ago
2008
Kleinberg [17] proposed in 2000 the first random graph model achieving to reproduce small world navigability, i.e. the ability to greedily discover polylogarithmic routes between a...
MATES
2010
Springer
14 years 8 months 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...
JCC
2011
14 years 4 months ago
2011
Abstract: Wordom is a versatile, user-friendly, and efficient program for manipulation and analysis of molecular structures and dynamics. The following new analysis modules have b...
SDM
2012
SIAM
13 years 1 days ago
2012
SIAM
Network-analysis literature is rich in node-centrality measures that quantify the centrality of a node as a function of the (shortest) paths of the network that go through it. Exi...