Pages that link to "Item:Q881799"

The following pages link to Hill-climbing and branch-and-bound algorithms for exact and approximate inference in credal networks (Q881799):

Displayed 7 items.

• Thirty years of credal networks: specification, algorithms and complexity (Q2206469) ‎ (← links)
• Unifying parameter learning and modelling complex systems with epistemic uncertainty using probability interval (Q2282037) ‎ (← 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)
• Learning recursive probability trees from probabilistic potentials (Q2375334) ‎ (← links)
• Approximate algorithms for credal networks with binary variables (Q2379306) ‎ (← links)
• Imprecise probability models for learning multinomial distributions from data. Applications to learning credal networks (Q2509602) ‎ (← links)