z-logo
open-access-imgOpen Access
Efficient Bounds in Heuristic Search Algorithms for Stochastic Shortest Path Problems
Author(s) -
Eric A. Hansen,
Ibrahim Abdoulahi
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.9643
Subject(s) - shortest path problem , mathematical optimization , heuristic , convergence (economics) , markov decision process , computer science , path (computing) , algorithm , mathematics , markov process , graph , theoretical computer science , statistics , programming language , economics , economic growth

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