Memory-Efficient Tree Size Prediction for Depth-First Search in Graphical Models.
Levi H. S. LelisLars OttenRina DechterPublished in: CP (2014)
Keyphrases
- graphical models
- memory efficient
- depth first search
- iterative deepening
- tree search
- breadth first search
- external memory
- belief propagation
- graph structure
- probabilistic model
- spanning tree
- probabilistic inference
- undirected graphical models
- bayesian networks
- approximate inference
- branch and bound
- search tree
- parallel tree search
- conditional random fields
- markov networks
- routing problem
- factor graphs
- tree structure
- r tree
- index structure
- linear programming
- upper bound
- lower bound
- computational complexity
- search algorithm