154 search results - page 9 / 31 » Anytime search in dynamic graphs |
AIPS
2003
13 years 10 months ago
2003
We propose a framework for policy generation in continuoustime stochastic domains with concurrent actions and events of uncertain duration. We make no assumptions regarding the co...
EUROGRAPHICS
2010
Eurographics
14 years 4 months ago
2010
Eurographics
We present an approach to improve the search efficiency for near-optimal motion synthesis using motion graphs. An optimal or near-optimal path through a motion graph often leads ...
CORR
2007
Springer
13 years 8 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
IAT
2010
IEEE
13 years 6 months ago
2010
IEEE
Intention recognition has significant applications in ambient intelligence, for example in assisted living and care of the elderly, in games and in intrusion and other crime detec...
MVA
1998
13 years 10 months ago
1998
An efficient matching method for segment-based stereo vision is proposed. A potential matching graph which describes the connectivity between candidate matching pairs of segments ...