202 search results - page 8 / 41 » Admissible Heuristics for Optimal Planning |
WSC
2000
13 years 11 months ago
2000
In the this paper, we study the problem of collective resource management. We first introduce the problem through realworld examples. Then we generalize the problem and build an a...
KR
2004
Springer
14 years 3 months ago
2004
Springer
Recent work shows that the memory requirements of bestfirst heuristic search can be reduced substantially by using a divide-and-conquer method of solution reconstruction. We show...
ICNS
2007
IEEE
14 years 4 months ago
2007
IEEE
Market-based compute grids encompass service providers offering limited resources to potential users with varying demands and willingness to pay. Providers face difficult decisions...
IJCAI
2003
13 years 11 months ago
2003
Markov decision processes (MDPs) and contingency planning (CP) are two widely used approaches to planning under uncertainty. MDPs are attractive because the model is extremely gen...
KI
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. Many heuristic estimators for classical planning are based on the socalled delete relaxation, which ignores negative effects of planning operators. Ideally, such heuristi...