473 search results - page 87 / 95 » Computing shortest paths with uncertainty |
ATAL
2008
Springer
14 years 11 months ago
2008
Springer
This paper describes an autonomous robot system designed to solve the challenging task of geocaching. Geocaching involves locating a goal object in an outdoor environment given on...
WEA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
CHI
1999
ACM
15 years 1 months ago
1999
ACM
not abstract asymmetry: different sides looks different clumps different from ”data objects” need grid structure, alignment [Design Guidelines for Landmarks to Support Navigati...
CCR
2004
14 years 9 months ago
2004
As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added e...
PVLDB
2008
14 years 9 months ago
2008
The class of k Nearest Neighbor (kNN) queries is frequently used in geospatial applications. Many studies focus on processing kNN in Euclidean and road network spaces. Meanwhile, ...