z-logo
open-access-imgOpen Access
Simpler Bounded Suboptimal Search
Author(s) -
Matthew Hatem,
Wheeler Ruml
Publication year - 2014
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.v28i1.8846
Subject(s) - bounded function , overhead (engineering) , implementation , computer science , search algorithm , node (physics) , search cost , search problem , mathematical optimization , state (computer science) , bidirectional search , incremental heuristic search , heuristics , best first search , algorithm , beam search , theoretical computer science , mathematics , engineering , mathematical analysis , structural engineering , microeconomics , economics , programming language , operating system

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