| Document Date: 2013-04-08 11:17:47
Open Document File Size: 294,42 KBShare Result on Facebook
City Nilsson / Basel / / Company Intel / / Country Switzerland / / / Facility Problem airport / / IndustryTerm baseline algorithm / contained operators / classical search space / search times / search node / cheapest operator / tree search / search memory requirements / heuristic search / incremental algorithm / heuristic search code / admissible tree search / frontier search / Divide-and-conquer bidirectional search / depth-first search / search nodes / heuristic search-based / search frontier / search graph / A∗ search / search tree / search space / search algorithm / search time / search effort / basic algorithm / search algorithms / / Organization Artificial Copyright Intelligence / Association for the Advancement / / Person Hart / / Position Downward planner / planner / / Product IDA / / ProvinceOrState New Jersey / Manitoba / / PublishedMedium Journal of Artificial Intelligence Research / / Technology second incremental algorithm / baseline algorithm / IDA∗ algorithm / artificial intelligence / LM-cut algorithm / search algorithm / search algorithms / basic algorithm / / URL www.aaai.org / /
SocialTag |
Incremental LM-Cut Florian Pommerening and Malte Helmert Universit¨at Basel Fachbereich Informatik BernoullistrasseBasel, Switzerland