Switch to: Citations

Add references

You must login to add references.
  1. Searching for an optimal path in a tree with random costs.Richard M. Karp & Judea Pearl - 1983 - Artificial Intelligence 21 (1-2):99-116.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Search rearrangement backtracking and polynomial average time.Paul Walton Purdom - 1983 - Artificial Intelligence 21 (1-2):117-133.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Probabilistic analysis of the complexity of A∗.Nam Huyn, Rina Dechter & Judea Pearl - 1980 - Artificial Intelligence 15 (3):241-254.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Depth-first iterative-deepening.Richard E. Korf - 1985 - Artificial Intelligence 27 (1):97-109.
    Download  
     
    Export citation  
     
    Bookmark   71 citations  
  • Heuristic search in restricted memory.P. P. Chakrabarti, S. Ghose, A. Acharya & S. C. de Sarkar - 1989 - Artificial Intelligence 41 (2):197-221.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Real-time heuristic search.Richard E. Korf - 1990 - Artificial Intelligence 42 (2-3):189-211.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Reducing reexpansions in iterative-deepening search by controlling cutoff bounds.U. K. Sarkar, P. P. Chakrabarti, S. Ghose & S. C. De Sarkar - 1991 - Artificial Intelligence 50 (2):207-221.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Epsilon-transformation: exploiting phase transitions to solve combinatorial optimization problems.Joseph C. Pemberton & Weixiong Zhang - 1996 - Artificial Intelligence 81 (1-2):297-325.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Phase transitions in artificial intelligence systems.Bernardo A. Huberman & Tad Hogg - 1987 - Artificial Intelligence 33 (2):155-171.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Iterative broadening.Matthew L. Ginsberg & William D. Harvey - 1992 - Artificial Intelligence 55 (2-3):367-383.
    Download  
     
    Export citation  
     
    Bookmark   7 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-6b65f85844-9bt58 uwo