The following pages link to (Q3979383):
Displaying 16 items.
- Multi-dimensional classification with Bayesian networks (Q648355) (← links)
- Approximating cost-based abduction is NP-hard (Q814635) (← links)
- AND/OR branch-and-bound search for combinatorial optimization in graphical models (Q1045990) (← links)
- A recurrence local computation approach towards ordering composite beliefs in Bayesian belief networks (Q1209534) (← links)
- Probabilistic Horn abduction and Bayesian networks (Q1313950) (← links)
- A linear constraint satisfaction approach to cost-based abduction (Q1313953) (← links)
- Cost-based abduction and MAP explanation (Q1327167) (← links)
- Finding MAPs for belief networks is NP-hard (Q1332845) (← links)
- Probabilistic conflicts in a search algorithm for estimating posterior probabilities in Bayesian networks (Q1391897) (← links)
- An optimal approximation algorithm for Bayesian inference (Q1402716) (← links)
- Probabilistic temporal networks: A unified framework for reasoning with time and uncertainty (Q1807606) (← links)
- The role of relevance in explanation. II: Disjunctive assignments and approximate independence (Q1809361) (← links)
- A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem (Q2468764) (← links)
- An algorithm for finding MAPs for belief networks through cost-based abduction (Q5906312) (← links)
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\) (Q5941313) (← links)
- Consistency restoration and explanations in dynamic CSPs---Application to configuration (Q5958543) (← links)
