Switch to: Citations

Add references

You must login to add references.
  1. The computational complexity of probabilistic inference using bayesian belief networks.Gregory F. Cooper - 1990 - Artificial Intelligence 42 (2-3):393-405.
    Download  
     
    Export citation  
     
    Bookmark   73 citations  
  • Optimal composition of real-time systems.Shlomo Zilberstein & Stuart Russell - 1996 - Artificial Intelligence 82 (1-2):181-213.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Coalitions among computationally bounded agents.Tuomas W. Sandhlom & Victor R. T. Lesser - 1997 - Artificial Intelligence 94 (1-2):99-137.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Approximating probabilistic inference in Bayesian belief networks is NP-hard.Paul Dagum & Michael Luby - 1993 - Artificial Intelligence 60 (1):141-153.
    Download  
     
    Export citation  
     
    Bookmark   31 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-7674574dd6-jhp86 uwo