Pages that link to "Item:Q2386120"
From MaRDI portal
The following pages link to Inference in credal networks: Branch-and-bound methods and the A/R+ algorithm (Q2386120):
Displaying 6 items.
- Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks (Q881799) (← links)
- Thirty years of credal networks: specification, algorithms and complexity (Q2206469) (← links)
- Approximate credal network updating by linear programming with applications to decision making (Q2344362) (← links)
- Updating credal networks is approximable in polynomial time (Q2375322) (← links)
- Approximate algorithms for credal networks with binary variables (Q2379306) (← links)
- Markov conditions and factorization in logical credal networks (Q6596686) (← links)
