z-logo
open-access-imgOpen Access
Single-Frontier Bidirectional Search
Author(s) -
Ariel Felner,
Carsten Moldenhauer,
Nathan Sturtevant,
Jonathan Schaeffer
Publication year - 2010
Publication title -
proceedings of the aaai conference on artificial intelligence
Language(s) - Uncategorized
Resource type - Journals
eISSN - 2374-3468
pISSN - 2159-5399
DOI - 10.1609/aaai.v24i1.7555
Subject(s) - frontier , node (physics) , computer science , tree (set theory) , shortest path problem , path (computing) , task (project management) , current (fluid) , search algorithm , range (aeronautics) , bidirectional search , mathematical optimization , algorithm , theoretical computer science , incremental heuristic search , mathematics , beam search , engineering , graph , computer network , geography , mathematical analysis , electrical engineering , structural engineering , archaeology , aerospace engineering , systems engineering

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom