The complexity of approximating MAPs for belief networks with bounded probabilities

, &
Artificial Intelligence 124 (2):283-288 (2000)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/s0004-3702(00)00076-x

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,709

External links

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

Through your library

My notes

Similar books and articles

Approximating MAPs for belief networks is NP-hard and other theorems.Ashraf M. Abdelbar & Sandra M. Hedetniemi - 1998 - Artificial Intelligence 102 (1):21-38.
An algorithm for rinding MAPs for belief networks through cost-based abduction.Ashraf M. Abdelbar - 1998 - Artificial Intelligence 104 (1-2):331-338.
Approximating probabilistic inference in Bayesian belief networks is NP-hard.Paul Dagum & Michael Luby - 1993 - Artificial Intelligence 60 (1):141-153.
How to use probabilities in reasoning.John L. Pollock - 1991 - Philosophical Studies 64 (1):65 - 85.
Complexity of networks II: The set complexity of edge‐colored graphs.Tomasz M. Ignac, Nikita A. Sakhanenko & David J. Galas - 2012 - Complexity 17 (5):23-36.
Pragmatic Interests and Imprecise Belief.Brad Armendt - 2013 - Philosophy of Science 80 (5):758-768.
Territories, corridors, and networks: A biological model for the premodern state.Monica L. Smith - 2007 - Complexity 12 (4):28-35.
Approximating cost-based abduction is NP-hard.Ashraf M. Abdelbar - 2004 - Artificial Intelligence 159 (1-2):231-239.
Territories, corridors, and networks: A biological model for the premodern state: Research Articles.Monica L. Smith - 2007 - Complexity 12 (4):28-35.
Complexity of networks I: The set‐complexity of binary graphs.Nikita A. Sakhanenko & David J. Galas - 2011 - Complexity 17 (2):51-64.
Complexity of networks (Reprise).Russell K. Standish - 2012 - Complexity 17 (3):50-61.
Using and understanding maps.Stephen Butterfill - unknown
Belief ascription under bounded resources.Natasha Alechina & Brian Logan - 2010 - Synthese 173 (2):179 - 197.
The sensitivity of belief networks to imprecise probabilities: an experimental investigation.A. Pradhan, M. Henrion, G. Provan, B. del Favero & K. Huang - 1996 - Artificial Intelligence 84 (1-2):357.
Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.

Analytics

Added to PP
2020-12-22

Downloads
8 (#1,312,814)

6 months
7 (#420,337)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Fusion, propagation, and structuring in belief networks.Judea Pearl - 1986 - Artificial Intelligence 29 (3):241-288.
Finding MAPs for belief networks is NP-hard.Solomon Eyal Shimony - 1994 - Artificial Intelligence 68 (2):399-410.

View all 6 references / Add more references