202 search results - page 6 / 41 » Admissible Heuristics for Optimal Planning |
83
Voted
ECAI
2010
Springer
15 years 1 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
14 years 11 days 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
15 years 2 months ago
2007
102
Voted
AINA
2005
IEEE
15 years 6 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, ...
114
Voted
AAAI
2006
15 years 1 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...