Decision Network Semantics of Branching
Download:
|
|
by K. Brown, P. Lucas, D. Fowler, Ken Brown, Peter Lucas, David Fowler
http://www.cs.kun.nl/research//reports/full/NIII-R0209.ps.gz
Add To MetaCart
Abstract:
Branching Constraint Satisfaction Problems (BCSPs) have been introduced to model dynamic resource allocation subject to constraints and uncertainty. We give BCSPs a formal probability semantics by showing how they can be mapped to a certain class of Bayesian decision networks. 1
Citations
| 4387 | Probabilistic Reasoning in Intelligent Systems – Pearl - 1988 |
| 1396 | Applied Dynamic Programming – Bellman, Dreyfus - 1962 |
| 903 | Local computations with probabilities on graphical structures and their applications to expert systems – Lauritzen, Spiegelhalter - 1988 |
| 629 | Foundations of Constraint Satisfaction – Tsang - 1993 |
| 411 | The computational complexity of probabilistic inference using Bayesian belief networks – Cooper - 1990 |
| 275 | Evaluating influence diagrams – Shachter - 1986 |
| 229 | Networks and Decision Graphs – Jensen - 2001 |
| 145 | Theory of Scheduling – Conway, Maxwell, et al. - 1967 |
| 65 | Introduction to graph theory – Wilson - 1972 |
| 36 | A method for using belief networks as influence diagrams – Cooper - 1988 |
| 17 | Branching constraint satisfaction problems for solutions robust under likely changes – Fowler, Brown - 2000 |
| 8 | Application of the Branch and Bound Technique to some Flow-Shop Scheduling Problems – Ignall, Schrage - 1965 |
