Sciweavers

1256 search results - page 103 / 252
» Experiences with the DEVStone benchmark
Sort
View
ICLP
2010
Springer
15 years 9 months ago
Improving the Efficiency of Gibbs Sampling for Probabilistic Logical Models by Means of Program Specialization
Abstract. There is currently a large interest in probabilistic logical models. A popular algorithm for approximate probabilistic inference with such models is Gibbs sampling. From ...
Daan Fierens
AAAI
2007
15 years 8 months ago
Macroscopic Models of Clique Tree Growth for Bayesian Networks
In clique tree clustering, inference consists of propagation in a clique tree compiled from a Bayesian network. In this paper, we develop an analytical approach to characterizing ...
Ole J. Mengshoel
AAAI
2007
15 years 8 months ago
Kernel Regression with Order Preferences
We propose a novel kernel regression algorithm which takes into account order preferences on unlabeled data. Such preferences have the form that point x1 has a larger target value...
Xiaojin Zhu, Andrew B. Goldberg
AAAI
2007
15 years 8 months ago
Point-Based Policy Iteration
We describe a point-based policy iteration (PBPI) algorithm for infinite-horizon POMDPs. PBPI replaces the exact policy improvement step of Hansen’s policy iteration with point...
Shihao Ji, Ronald Parr, Hui Li, Xuejun Liao, Lawre...
FLAIRS
2008
15 years 8 months ago
The Introspective Robot: Using Self-Prediction to Improve Robot Learning
We investigate the use of self-predicting neural networks for autonomous robot learning within noisy or partially predictable environments. A benchmark experiment is performed in ...
James B. Marshall, Neil K. Makhija, Zachary D. Rot...