Inference in Credal Networks with Branch-and-Bound Algorithms.
José Carlos Ferreira da RochaFábio Gagliardi CozmanPublished in: ISIPTA (2003)
Keyphrases
- branch and bound algorithm
- credal networks
- bayesian networks
- maximum entropy
- set valued
- branch and bound
- lower bound
- upper bound
- set covering problem
- optimal solution
- combinatorial optimization
- np hard
- search tree
- haplotype inference
- boolean satisfiability
- probabilistic inference
- finding an optimal solution
- directed acyclic graph
- neural network
- variational inequalities
- random variables
- logic programs
- independence relations
- reinforcement learning