810 search results - page 41 / 162 » Solving Time-Dependent Planning Problems |
ICCBR
2005
Springer
14 years 1 months ago
2005
Springer
An adaptation phase is crucial for a good and reasonable Case-Based Planning (CBP) system. The adaptation phase is responsible for finding a solution in order to solve a new proble...
AI
1999
Springer
13 years 7 months ago
1999
Springer
There are many different approaches to solving planning problems, one of which is the use of domain specific control knowledge to help guide a domain independent search algorithm. ...
CP
2004
Springer
14 years 1 months ago
2004
Springer
We combine mixed integer linear programming (MILP) and constraint programming (CP) to solve planning and scheduling problems. Tasks are allocated to facilities using MILP and sche...
CI
2011
13 years 3 months ago
2011
We investigate the application of modern planning techniques to domains arising from problems in natural language generation (NLG). In particular, we consider two novel NLGinspire...
LOGCOM
2011
12 years 11 months ago
2011
Planning as Satisfiability is one of the most well-known and effective techniques for classical planning: satplan has been the winning system in the deterministic track for optim...