170 search results - page 8 / 34 » Solving Simple Planning Problems with More Inference and No ... |
BIRTHDAY
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. Heuristic programming was the first area in which AI methods were tested. The favourite case-studies were fairly simple toyproblems, such as cryptarithmetic, games, such ...
CP
2007
Springer
14 years 1 months ago
2007
Springer
Searching for optimal solutions to a problem using lower bounds obtained from a relaxation is a common idea in Heuristic Search and Planning. In SAT and CSPs, however, explicit rel...
ICTAI
2002
IEEE
14 years 14 days ago
2002
IEEE
(Appears as a regular paper in the proceedings of IEEE International Conference on Tools with Artificial Intelligence (ICTAI), IEEE Computer Society, Washington D.C, Nov. 2002, p...
AI
2011
Springer
13 years 2 months ago
2011
Springer
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
AAAI
1998
13 years 9 months ago
1998
Production planning is an important task in manufacturing systems. We consider a real-world capacitated lot-sizing problem (CLSP) from the process industry. Because the problem re...