Sciweavers

6943 search results - page 1258 / 1389
» Representations for evolutionary algorithms
Sort
View
IJCAI
2007
15 years 7 months ago
Compiling Bayesian Networks Using Variable Elimination
Compiling Bayesian networks has proven an effective approach for inference that can utilize both global and local network structure. In this paper, we define a new method of comp...
Mark Chavira, Adnan Darwiche
149
Voted
IJCAI
2007
15 years 7 months ago
Compiling Bayesian Networks by Symbolic Probability Calculation Based on Zero-Suppressed BDDs
Compiling Bayesian networks (BNs) is one of the hot topics in the area of probabilistic modeling and processing. In this paper, we propose a new method of compiling BNs into multi...
Shin-ichi Minato, Ken Satoh, Taisuke Sato
IJCAI
2007
15 years 7 months ago
Using Linear Programming for Bayesian Exploration in Markov Decision Processes
A key problem in reinforcement learning is finding a good balance between the need to explore the environment and the need to gain rewards by exploiting existing knowledge. Much ...
Pablo Samuel Castro, Doina Precup
NIPS
2008
15 years 7 months ago
Stochastic Relational Models for Large-scale Dyadic Data using MCMC
Stochastic relational models (SRMs) [15] provide a rich family of choices for learning and predicting dyadic data between two sets of entities. The models generalize matrix factor...
Shenghuo Zhu, Kai Yu, Yihong Gong
MEDINFO
2007
102views Healthcare» more  MEDINFO 2007»
15 years 7 months ago
Automatic Treatment of Temporal Issues in Clinical Guidelines in the GLARE System
Temporal constraints play a fundamental role in clinical guidelines. For example, temporal indeterminacy, constraints about duration, delays between actions and periodic repetitio...
Luca Anselma, Paolo Terenziani, Stefania Montani, ...
« Prev « First page 1258 / 1389 Last » Next »