914 search results - page 93 / 183 » The Computational Complexity of Probabilistic Planning |
133
click to vote
STOC
1998
ACM
15 years 8 months ago
1998
ACM
Current formal models for quantum computation deal only with unitary gates operating on “pure quantum states”. In these models it is difficult or impossible to deal formally w...
147
click to vote
AIPS
2008
15 years 6 months ago
2008
Enforced hill-climbing is an effective deterministic hillclimbing technique that deals with local optima using breadth-first search (a process called "basin flooding"). ...
152
click to vote
IPMI
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The detection and extraction of complex anatomical structures usually involves a trade-off between the complexity of local feature extraction and classification, and th...
144
Voted
IROS
2006
IEEE
15 years 10 months ago
2006
IEEE
— In this paper we address smooth and collision-free whole-body motion planning for humanoid robots. A two-stage iterative planning framework is introduced where geometric motion...
188
click to vote
CGA
2002
15 years 4 months ago
2002
Populated urban environments are very important in many applications such as urban planning and entertainment. However rendering in real time many people in a complex environment ...