Open AccessRecursive Best-First Search with Bounded Overhead
Author(s) -
Matthew Hatem,
Scott Kiesel,
Wheeler Ruml
Publication year - 2015
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - English
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v29i1.9352
Subject(s) - overhead (engineering) , iterative deepening depth first search , computer science , incremental heuristic search , mathematical optimization , heuristic , best first search , bounding overwatch , bounded function , node (physics) , bidirectional search , search algorithm , algorithm , beam search , mathematics , artificial intelligence , engineering , mathematical analysis , structural engineering , operating system
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom