Sciweavers

172 search results - page 11 / 35
» How to Specialize by Theory Refinement
Sort
View
RSA
2008
87views more  RSA 2008»
14 years 9 months ago
A combinatorial approach to jumping particles: The parallel TASEP
In this paper we continue the combinatorial study of models of particles jumping on a row of cells which we initiated with the standard totally asymmetric exclusion process or TASE...
Enrica Duchi, Gilles Schaeffer
CP
2008
Springer
14 years 11 months ago
Approximate Compilation of Constraints into Multivalued Decision Diagrams
We present an incremental refinement algorithm for approximate compilation of constraint satisfaction models into multivalued decision diagrams (MDDs). The algorithm uses a vertex ...
Tarik Hadzic, John N. Hooker, Barry O'Sullivan, Pe...
UAI
1994
14 years 11 months ago
Global Conditioning for Probabilistic Inference in Belief Networks
In this paper we propose a new approach to probabilistic inference on belief networks, global conditioning, which is a simple generalization of Pearl's (1986b) method of loop...
Ross D. Shachter, Stig K. Andersen, Peter Szolovit...
UAI
2007
14 years 10 months ago
User-Centered Methods for Rapid Creation and Validation of Bayesian Belief Networks
Bayesian networks (BN) are particularly well suited to capturing vague and uncertain knowledge. However, the capture of this knowledge and associated reasoning from human domain e...
Jonathan D. Pfautz, Zach Cox, Geoffrey Catto, Davi...
BIRTHDAY
2005
Springer
15 years 3 months ago
Agents with Exact Foreknowledge
Computational experiments are reported involving the concept of foreknowledge, an agent’s direct, unmediated and accurate, but possibly incomplete, awareness of its future includ...
Jim Doran