408 search results - page 5 / 82 » A lookahead strategy for solving large planning problems |
104
click to vote
ICMLA
2007
15 years 3 months ago
2007
Our research addresses the issue of developing knowledge-based agents that capture and use the problem solving knowledge of subject matter experts from diverse application domains...
137
click to vote
CP
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. In this paper, we present a constraint-partitioning approach for finding local optimal solutions of large-scale mixed-integer nonlinear programming problems (MINLPs). Ba...
119
Voted
ICPP
2008
IEEE
15 years 8 months ago
2008
IEEE
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
IROS
2006
IEEE
15 years 7 months ago
2006
IEEE
— A recent study showed that high failure rates in many instances of decoupled multi-robot motion planning makes the decoupled planning approach an unsuitable choice in compariso...
129
Voted
ECAI
2004
Springer
15 years 7 months ago
2004
Springer
In the past, Markov Decision Processes (MDPs) have become a standard for solving problems of sequential decision under uncertainty. The usual request in this framework is the compu...