| Document Date: 2013-01-07 17:29:29
Open Document File Size: 189,63 KBShare Result on Facebook
City Brafman / Freiburg / / Company Ei / Pearson / AMD / Russell / / / IndustryTerm search strategies / depth-first search algorithms / search node / polynomial algorithms / heuristic search / dedicated search space / admissible tree search / search state / post-processing technique / cheapest solution / search interval / Depth-first branch-and-bound search / informed search procedure / branchand-bound search / applicable operator / search tree / chosen operator / branch-and-bound algorithm / Branch-andbound search / search space / search effort / cheaper solution / branch-and-bound search / / Organization Incremental LM-cut Florian Pommerening Malte Helmert Albert-Ludwigs-Universit¨at Freiburg Institut f¨ur Informatik Georges-K¨ohler-Allee / Artificial Copyright Intelligence / Association for the Advancement / / Person Florian Pommerening Malte Helmert / / Position translator / first author / state-ofthe-art planner / planner / / ProvinceOrState Rhode Island / / PublishedMedium Communications of the ACM / Journal of Artificial Intelligence Research / Lecture Notes in Computer Science / / Technology resulting algorithm / IDA∗ algorithm / artificial intelligence / search algorithms / polynomial algorithms / branch-and-bound algorithm / two algorithms / / URL www.aaai.org / /
SocialTag |
Optimal Planning for Delete-free Tasks with Incremental LM-cut Florian Pommerening Malte Helmert Albert-Ludwigs-Universit¨at Freiburg