Sciweavers

143 search results - page 22 / 29
» ijcai 2001
Sort
View
IJCAI
2001
14 years 11 months ago
Approximate inference for first-order probabilistic languages
A new, general approach is described for approximate inference in first-order probabilistic languages, using Markov chain Monte Carlo (MCMC) techniques in the space of concrete po...
Hanna Pasula, Stuart J. Russell
IJCAI
2001
14 years 11 months ago
An On-line Decision-Theoretic Golog Interpreter
We consider an on-line decision-theoretic interpreter and incremental execution of Golog programs. This new interpreter is intended to overcome some limitations of the off-line in...
Mikhail Soutchanski
IJCAI
2001
14 years 11 months ago
R-MAX - A General Polynomial Time Algorithm for Near-Optimal Reinforcement Learning
R-max is a very simple model-based reinforcement learning algorithm which can attain near-optimal average reward in polynomial time. In R-max, the agent always maintains a complet...
Ronen I. Brafman, Moshe Tennenholtz
IJCAI
2001
14 years 11 months ago
Backjumping for Quantified Boolean Logic Satisfiability
The implementation of effective reasoning tools for deciding the satisfiability of Quantified Boolean Formulas (QBFs) is an important research issue in Artificial Intelligence. Ma...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
IJCAI
2001
14 years 11 months ago
Probabilistic Classification and Clustering in Relational Data
Supervised and unsupervised learning methods have traditionally focused on data consisting of independent instances of a single type. However, many real-world domains are best des...
Benjamin Taskar, Eran Segal, Daphne Koller