Research map / Learning theory and algorithms / Combinatorial and search optimization
Branch and Bound Search for Exact MAP Inference in Credal Networks
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Credal Marginal MAP (NeurIPS 2023 · similarity 0.93)
- Abductive Reasoning in Logical Credal Networks (NeurIPS 2024 · similarity 0.89)
- Learning Bayesian Networks with Bounded Tree-width via Guided Search (AAAI 2016 · similarity 0.87)
- Anytime Anyspace AND/OR Best-First Search for Bounding Marginal MAP (AAAI 2018 · similarity 0.86)
- Decomposing Constraint Networks for Calculating c-Representations (AAAI 2024 · similarity 0.84)
- Credal Wrapper of Model Averaging for Uncertainty Estimation in Classification (ICLR 2025 · similarity 0.84)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.