914 search results - page 96 / 183 » The Computational Complexity of Probabilistic Planning |
129
click to vote
ISTCS
1995
Springer
15 years 7 months ago
1995
Springer
A low-degree test is a collection of simple, local rules for checking the proximity of an arbitrary function to a lowdegree polynomial. Each rule depends on the function’s value...
170
click to vote
CVPR
2011
IEEE
15 years 16 days ago
2011
IEEE
We present a framework for the automatic recognition of complex multi-agent events in settings where structure is imposed by rules that agents must follow while performing activit...
135
click to vote
HUC
1999
Springer
15 years 8 months ago
1999
Springer
BUILD-IT is a planning tool based on computer vision technology, supporting complex planning and composition tasks. A group of people, seated around a table, interact with objects ...
208
click to vote
CSCLP
2008
Springer
15 years 6 months ago
2008
Springer
In the analysis of hybrid discrete-continuous systems, rich arithmetic constraint formulae with complex Boolean structure arise naturally. The iSAT algorithm, a solver for such for...
122
click to vote
ICRA
2005
IEEE
15 years 10 months ago
2005
IEEE
— A number of advanced sampling strategies have been proposed in recent years to address the narrow passage problem for probabilistic roadmap (PRM) planning. These sampling strat...