Approximating MAPs for belief networks is NP-hard and other theorems (Q1274288): Difference between revisions

@@ Property / cites work @@
+The complexity of approximating MAPs for belief networks with bounded probabilities
+Normal rank
@@ Property / cites work @@
+Cost-based abduction and MAP explanation
@@ Property / cites work: Cost-based abduction and MAP explanation / rank @@
+Normal rank
@@ Property / cites work @@
+The computational complexity of probabilistic inference using Bayesian belief networks
+Normal rank
@@ Property / cites work @@
+Approximating probabilistic inference in Bayesian belief networks is NP- hard
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4692508
@@ Property / cites work: Q4692508 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization by Simulated Annealing
@@ Property / cites work: Optimization by Simulated Annealing / rank @@
+Normal rank
@@ Property / cites work @@
+Q4734791
@@ Property / cites work: Q4734791 / rank @@
+Normal rank
@@ Property / cites work @@
+On the ratio of optimal integral and fractional covers
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Fusion, propagation, and structuring in belief networks
+Normal rank
@@ Property / cites work @@
+Belief networks revisited
@@ Property / cites work: Belief networks revisited / rank @@
+Normal rank
@@ Property / cites work @@
+A linear constraint satisfaction approach to cost-based abduction
+Normal rank
@@ Property / cites work @@
+Finding MAPs for belief networks is NP-hard
@@ Property / cites work: Finding MAPs for belief networks is NP-hard / rank @@
+Normal rank