Portfolios in Stochastic Local Search: Efficiently Computing Most Probable Explanations in Bayesian Networks.
Ole J. MengshoelDan RothDavid C. WilkinsPublished in: J. Autom. Reason. (2011)
Keyphrases
- efficiently computing
- stochastic local search
- bayesian networks
- probability distribution
- satisfiability problem
- combinatorial optimisation
- random sat instances
- olap data cubes
- phase transition
- randomly generated
- max sat
- solving hard
- sat instances
- structure learning
- belief networks
- sat problem
- probabilistic reasoning
- knowledge base
- temporal constraints
- index structure
- np complete
- knowledge representation
- expressive power
- np hard
- search algorithm