3678 search results - page 318 / 736 » On the Stable Paths Problem |
189
Voted
SIGMOD
2004
ACM
16 years 5 days ago
2004
ACM
Clustering is one of the most important analysis tasks in spatial databases. We study the problem of clustering objects, which lie on edges of a large weighted spatial network. Th...
173
click to vote
ICRA
1999
IEEE
15 years 11 months ago
1999
IEEE
In future planetary exploration missions, rovers will be required to autonomously traverse challenging environments. Much of the previous work in robot motion planning cannot be s...
164
click to vote
IPPS
1998
IEEE
15 years 11 months ago
1998
IEEE
Abstract. Finding paths in high-dimensional gemetric spaces is a provably hard problem. Recently, a general randomized planning scheme has emerged as an e ective approach to solve ...
182
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
162
click to vote
IJCAI
2007
15 years 8 months ago
2007
We investigate search problems under risk in statespace graphs, with the aim of finding optimal paths for risk-averse agents. We consider problems where uncertainty is due to the...