202 search results - page 6 / 41 » Admissible Heuristics for Optimal Planning |
ECAI
2010
Springer
13 years 9 months ago
2010
Springer
The landmark cut heuristic is perhaps the strongest known polytime admissible approximation of the optimal delete relaxation heuristic h+ . Equipped with this heuristic, a best-fir...
AAAI
2011
12 years 8 months ago
2011
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
AIPS
2007
13 years 11 months ago
2007
AINA
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper, we intend to solve the problem of maximum-revenue multicast routing with a partial admission control mechanism for multirate multimedia distribution. Specifically, ...
AAAI
2006
13 years 10 months ago
2006
We describe an application of AI search and information visualization techniques to the problem of school redistricting, in which students are assigned to home schools within a co...