Memory Intensive Branch-and-Bound Search for Graphical Models.
Radu MarinescuRina DechterPublished in: AAAI (2006)
Keyphrases
- graphical models
- branch and bound search
- belief propagation
- branch and bound
- probabilistic model
- search algorithm
- approximate inference
- search tree
- random variables
- search strategy
- bayesian networks
- arc consistency
- search heuristics
- structure learning
- conditional random fields
- conditional independence
- cutting plane algorithm
- lower bound
- markov networks
- lagrangian relaxation
- iterative deepening
- message passing
- main memory
- optimal solution