Switch to: Citations

Add references

You must login to add references.
  1. Potential-based bounded-cost search and Anytime Non-Parametric A ⁎.Roni Stern, Ariel Felner, Jur van den Berg, Rami Puzis, Rajat Shah & Ken Goldberg - 2014 - Artificial Intelligence 214 (C):1-25.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Heuristic search viewed as path finding in a graph.Ira Pohl - 1970 - Artificial Intelligence 1 (3-4):193-204.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
    Download  
     
    Export citation  
     
    Bookmark   71 citations  
  • Time complexity of iterative-deepening-A∗.Richard E. Korf, Michael Reid & Stefan Edelkamp - 2001 - Artificial Intelligence 129 (1-2):199-218.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Predicting the size of IDA*ʼs search tree.Levi H. S. Lelis, Sandra Zilles & Robert C. Holte - 2013 - Artificial Intelligence 196 (C):53-76.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Inconsistent heuristics in theory and practice.Ariel Felner, Uzi Zahavi, Robert Holte, Jonathan Schaeffer, Nathan Sturtevant & Zhifu Zhang - 2011 - Artificial Intelligence 175 (9-10):1570-1603.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Disjoint pattern database heuristics.Richard E. Korf & Ariel Felner - 2002 - Artificial Intelligence 134 (1-2):9-22.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Learning heuristic functions for large state spaces.Shahab Jabbari Arfaee, Sandra Zilles & Robert C. Holte - 2011 - Artificial Intelligence 175 (16-17):2075-2098.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Probably approximately optimal satisficing strategies.Russell Greiner & Pekka Orponen - 1996 - Artificial Intelligence 82 (1-2):21-44.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-6f97f49787-zrclg uwo