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...
Planning agents often lack the computational resources needed to build full planning trees for their environments. Agent designers commonly overcome this finite-horizon approxima...
Jonathan Sorg, Satinder P. Singh, Richard L. Lewis
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, ...
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...
Marie desJardins, Blazej Bulka, Ryan Carr, Andrew ...