45 citations · 65 across the 5 of their papers we have counts for
5 papers
A Dynamic Approach to Probabilistic Inference
Michael C. Horsch, David L. Poole
In this paper we present a framework for dynamically constructing Bayesian networks. We introduce the notion of a background knowledge base of schemata, which is a collection of pa…
Flexible Policy Construction by Information Refinement
Michael C. Horsch, David L. Poole
We report on work towards flexible algorithms for solving decision problems represented as influence diagrams. An algorithm is given to construct a tree structure for each decision…
An Anytime Algorithm for Decision Making under Uncertainty
Michael C. Horsch, David L. Poole
We present an anytime algorithm which computes policies for decision problems represented as multi-stage influence diagrams. Our algorithm constructs policies incrementally, starti…
Estimating the Value of Computation in Flexible Information Refinement
Michael C. Horsch, David L. Poole
We outline a method to estimate the value of computation for a flexible algorithm using empirical data. To determine a reasonable trade-off between cost and value, we build an empi…
Probabilistic Arc Consistency: A Connection between Constraint Reasoning and Probabilistic Reasoning
Michael C. Horsch, Bill Havens
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called {em probabilistic arc consistency}, which is both a generalizatio…