Switch to: Citations

Add references

You must login to add references.
  1. The *-minimax search procedure for trees containing chance nodes.Bruce W. Ballard - 1983 - Artificial Intelligence 21 (3):327-350.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Strips: A new approach to the application of theorem proving to problem solving.Richard E. Fikes & Nils J. Nilsson - 1971 - Artificial Intelligence 2 (3-4):189-208.
    Download  
     
    Export citation  
     
    Bookmark   217 citations  
  • Planning in a hierarchy of abstraction spaces.Earl D. Sacerdoti - 1974 - Artificial Intelligence 5 (2):115-135.
    Download  
     
    Export citation  
     
    Bookmark   119 citations  
  • Real-time heuristic search.Richard E. Korf - 1990 - Artificial Intelligence 42 (2-3):189-211.
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Learning to act using real-time dynamic programming.Andrew G. Barto, Steven J. Bradtke & Satinder P. Singh - 1995 - Artificial Intelligence 72 (1-2):81-138.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Automatically generating abstractions for planning.Craig A. Knoblock - 1994 - Artificial Intelligence 68 (2):243-302.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Deliberation scheduling for problem solving in time-constrained environments.Mark Boddy & Thomas L. Dean - 1994 - Artificial Intelligence 67 (2):245-285.
    Download  
     
    Export citation  
     
    Bookmark   11 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-7b7f6c6655-47mn7 uwo