810 search results - page 19 / 162 » Solving Time-Dependent Planning Problems |
SARA
2009
Springer
14 years 3 months ago
2009
Springer
Constraint Programming is an attractive approach for solving AI planning problems by modelling them as Constraint Satisfaction Problems (CSPs). However, formulating effective cons...
CCO
2001
Springer
14 years 1 months ago
2001
Springer
Abstract. We study in this lecture the literature on mixed integer programming models and formulations for a specific problem class, namely deterministic production planning probl...
COR
2006
13 years 9 months ago
2006
Peg Solitaire is a well known puzzle which can prove difficult despite its simple rules. Pegs are arranged on a board such that at least one `hole' remains. By making draught...
AAAI
2012
11 years 11 months ago
2012
We address the problem of spatial conservation planning in which the goal is to maximize the expected spread of cascades of an endangered species by strategically purchasing land ...
CP
2010
Springer
13 years 7 months ago
2010
Springer
Generic SAT solvers have been very successful in solving hard combinatorial problems in various application areas, including AI planning. There is potential for improved performanc...