MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for "Anytime Heuristic Search." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 13 documents found, showing 1 through 10. Next 10 →
ATOM RSS
  • Anytime heuristic search  
  • by Eric A. Hansen, Rong Zhou — 2007 — Journal of Artificial Intelligence Research (JAIR
  • …/07 Anytime Heuristic Search Eric A. Hansen hansen@(email omitted); Department of Computer Science…
  • Cited by 4 (0 self) – Add To MetaCart
  • Anytime Heuristic Search: First Results  
  • by Eric A. Hansen, Eric A. Hansen, Shlomo Zilberstein, Shlomo Zilberstein, Victor A. Danilchenko, Victor A. Danilchenko — 1997
  • …Anytime Heuristic Search: First Results Eric A. Hansen Shlomo Zilberstein Victor A. Danilchenko…
  • Cited by 18 (2 self) – Add To MetaCart
  • ARA*: Formal Analysis  
  • by Maxim Likhachev, Geoff Gordon, Sebastian Thrun — 2003
  • … the ARA* algorithm. ARA* is an anytime heuristic search which tunes its performance bound based…
  • Cited by 5 (3 self) – Add To MetaCart
  • Eric A. Hansen Shlomo Zilberstein Victor A. Danilchenko  
  • by September Eric Hansen, Eric A. Hansen, Eric A. Hansen, Shlomo Zilberstein, Shlomo Zilberstein, Victor A. Danilchenko, Victor A. Danilchenko — 1997
  • …Anytime Heuristic Search: First Results Eric A. Hansen Shlomo Zilberstein Victor A. Danilchenko…
  • Add To MetaCart
  • ARA*: Anytime A* with Provable Bounds on Sub-Optimality  
  • by Maxim Likhachev, Geoff Gordon, Sebastian Thrun — 2004 — IN ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 16: PROCEEDINGS OF THE 2003 CONFERENCE (NIPS-03
  • … and then continually work on improving it until time runs out. In this paper we propose an anytime heuristic search…
  • Cited by 14 (4 self) – Add To MetaCart
  • ARA*: Anytime A* with Provable Bounds on  
  • by Sub-Optimality Maxim Likhachev, Maxim Likhachev, Geoff Gordon, Sebastian Thrun — 2004 — In Advances in Neural Information Processing Systems 16: Proceedings of the 2003 Conference (NIPS-03
  • … and then continually work on improving it until time runs out. In this paper we propose an anytime heuristic search…
  • Add To MetaCart
  • Before we begin  
  • by Stephen Hladky, Basics Of Classic A — 2006
  • …Anytime Heuristic Search Stephen Hladky CMPUT 651 September 13, 2006 Before we begin • A loose…
  • Add To MetaCart
Help! Showing 1 through 10. Next 10 →
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB