Switch to: Citations

Add references

You must login to add references.
  1. 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  
  • Network-based heuristics for constraint-satisfaction problems.Rina Dechter & Judea Pearl - 1987 - Artificial Intelligence 34 (1):1-38.
    Download  
     
    Export citation  
     
    Bookmark   55 citations  
  • Partial constraint satisfaction.Eugene C. Freuder & Richard J. Wallace - 1992 - Artificial Intelligence 58 (1-3):21-70.
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Linear-space best-first search.Richard E. Korf - 1993 - Artificial Intelligence 62 (1):41-78.
    Download  
     
    Export citation  
     
    Bookmark   28 citations  
  • Bucket elimination: A unifying framework for reasoning.Rina Dechter - 1999 - Artificial Intelligence 113 (1-2):41-85.
    Download  
     
    Export citation  
     
    Bookmark   22 citations