Loading...
Please wait, while we are loading the content...
Similar Documents
Optimal Depth-First Strategies for And-Or Trees (2002)
| Content Provider | CiteSeerX |
|---|---|
| Author | Greiner, Russell Hayward, Ryan Molloy, Michael |
| Abstract | A probabilistic boolean expression (PBE) consists of a boolean expression over a set of boolean variables, each with a corresponding cost and probability value that indicates respectively the cost of determining a variable's value and the probability that the value is true. Given a PBE, a resolution strategy is a sequential testing algorithm that determines the value of the expression, where each test is a query of the value of one variable. A strategy is optimal if its expected cost is minimum, over all possible strategies. The minimum cost resolution strategy problem (MRSP) is to find an optimal strategy of a given PBE. As MRSP |
| File Format | |
| Publisher Date | 2002-01-01 |
| Access Restriction | Open |
| Subject Keyword | Possible Strategy Probability Value And-or Tree Boolean Expression Optimal Depth-first Strategy Probabilistic Boolean Expression Sequential Testing Algorithm Minimum Cost Resolution Strategy Problem Corresponding Cost Optimal Strategy Boolean Variable Resolution Strategy |
| Content Type | Text |
