Computing Upper Bounds for a LBPP with and without Probabilistic Constraints.
Hugo RodríguezPablo AdasmeAbdel LisserIsmael SotoPublished in: INOC (2011)
Keyphrases
- upper bound
- lower and upper bounds
- lower bound
- upper and lower bounds
- bayesian networks
- branch and bound
- branch and bound algorithm
- generative model
- worst case
- constraint satisfaction
- data driven
- relational databases
- tight bounds
- belief networks
- geometric constraints
- sample complexity
- probabilistic model
- efficiently computing