914 search results - page 11 / 183 » The Computational Complexity of Probabilistic Planning |
IROS
2007
IEEE
14 years 1 months ago
2007
IEEE
— In this paper, we propose a new method for the motion planning problem of rigid object dexterous manipulation with a robotic multi-fingered hand, under quasi-static movement a...
JC
2006
13 years 7 months ago
2006
We prove upper bounds on the order and degree of the polynomials involved in a resolvent representation of the prime differential ideal associated with a polynomial differential s...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
Abstract Climbing robots that climb flat structures using suction cups or magnets are commonly described in the literature. However, robots that can autonomously find randomly plac...
RSFDGRC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In this paper, we revisit the consensus of computational complexity on exact inference in Bayesian networks. We point out that even in singly connected Bayesian networks,...
DCC
1999
IEEE
13 years 12 months ago
1999
IEEE
In this paper we consider the problem of searching for the best match for an input among a set of vectors, according to some predetermined metric. Examples of this problem include...