Switch to: References

Add citations

You must login to add citations.
  1. Improving heuristic mini-max search by supervised learning.Michael Buro - 2002 - Artificial Intelligence 134 (1-2):85-99.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The effect of mobility on minimaxing of game trees with random leaf values.Mark Levene & Trevor I. Fenner - 2001 - Artificial Intelligence 130 (1):1-26.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
  • Qualitative simulation of temporal concurrent processes using Time Interval Petri Nets.Vadim Bulitko & David C. Wilkins - 2003 - Artificial Intelligence 144 (1-2):95-124.
    Download  
     
    Export citation  
     
    Bookmark  
    		•
  • Bargaining with limited computation: Deliberation equilibrium.Kate Larson & Tuomas Sandholm - 2001 - Artificial Intelligence 132 (2):183-217.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Partial order bounding: A new approach to evaluation in game tree search.Martin Müller - 2001 - Artificial Intelligence 129 (1-2):279-311.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
    • 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-c4c498947-n7slk uwo