Sciweavers

408 search results - page 5 / 82
» A lookahead strategy for solving large planning problems
Sort
View
ICMLA
2007
14 years 11 months ago
Learning complex problem solving expertise from failures
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...
Cristina Boicu, Gheorghe Tecuci, Mihai Boicu
CP
2005
Springer
15 years 3 months ago
Solving Large-Scale Nonlinear Programming Problems by Constraint Partitioning
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...
Benjamin W. Wah, Yixin Chen
ICPP
2008
IEEE
15 years 4 months ago
Solving Large, Irregular Graph Problems Using Adaptive Work-Stealing
Solving large, irregular graph problems efficiently is challenging. Current software systems and commodity multiprocessors do not support fine-grained, irregular parallelism wel...
Guojing Cong, Sreedhar B. Kodali, Sriram Krishnamo...
60
Voted
IROS
2006
IEEE
100views Robotics» more  IROS 2006»
15 years 3 months ago
Multi-Robot Motion Planning by Incremental Coordination
— 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...
Mitul Saha, Pekka Isto
ECAI
2004
Springer
15 years 3 months ago
On-Line Search for Solving Markov Decision Processes via Heuristic Sampling
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...
Laurent Péret, Frédérick Garc...