473 search results - page 59 / 95 » Computing shortest paths with uncertainty |
57
Voted
CHI
2005
ACM
15 years 10 months ago
2005
ACM
I have been active in SIGCHI since 1983, serving on the Executive Committee and many conference and program committees. After editing ACM TOCHI for six years, I explored the histo...
92
Voted
ICDCS
1999
IEEE
15 years 2 months ago
1999
IEEE
To provide real-time service or engineer constrained-based paths, networks require the underlying routing algorithm to be able to find low-cost paths that satisfy given Quality-of...
74
Voted
BIRTHDAY
2009
Springer
15 years 4 months ago
2009
Springer
We consider a class of arithmetic equations over the complete lattice of integers (extended with −∞ and ∞) and provide a polynomial time algorithm for computing least solutio...
80
Voted
SIGMOD
2010
ACM
15 years 2 months ago
2010
ACM
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
AUTOMATICA
2010
14 years 9 months ago
2010
This paper addresses planning of continuous paths for mobile sensors to reduce uncertainty in some quantities of interest in the future. The mutual information between the measure...