Approximate belief updating in max-2-connected Bayes networks is NP-hard

Artificial Intelligence 173 (12-13):1150-1153 (2009)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,809

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.
Approximating cost-based abduction is NP-hard.Ashraf M. Abdelbar - 2004 - Artificial Intelligence 159 (1-2):231-239.

Analytics

Added to PP
2020-12-22

Downloads
12 (#1,365,662)

6 months
4 (#1,246,434)

Historical graph of downloads
How can I increase my downloads?