473 search results - page 60 / 95 » Computing shortest paths with uncertainty |
AIPS
2009
14 years 10 months ago
2009
Recent research in robot exploration and mapping has focused on sampling environmental hotspot fields. This exploration task is formalized by Low, Dolan, and Khosla (2008) in a se...
111
click to vote
CORR
2009
Springer
14 years 7 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...
DBA
2004
14 years 11 months ago
2004
This paper discusses how to extend the applicability of the recursive cascade update command of the Xplain query language. This command guarantees termination because cycle detect...
71
Voted
STACS
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We consider variations of two well-known centrality measures, betweenness and closeness, with a different model of information spread. Rather than along shortest paths o...
EMMCVPR
2003
Springer
15 years 2 months ago
2003
Springer
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...