Sciweavers

1080 search results - page 27 / 216
» The Complexity of Belief Update
Sort
View
ECAI
2008
Springer
15 years 8 months ago
Exploiting locality of interactions using a policy-gradient approach in multiagent learning
In this paper, we propose a policy gradient reinforcement learning algorithm to address transition-independent Dec-POMDPs. This approach aims at implicitly exploiting the locality...
Francisco S. Melo
UAI
1997
15 years 7 months ago
Exploring Parallelism in Learning Belief Networks
It has been shown that a class of probabilistic domain models cannot be learned correctly by several existing algorithms which employ a single-link lookahead search. When a multil...
Tongsheng Chu, Yang Xiang
DEDUCTIVE
1994
119views Database» more  DEDUCTIVE 1994»
15 years 7 months ago
Determining Correct View Update Translations via Query Containment
Given an intensional database (IDB) and an extension database (EDB), the view update problem translates updates on the IDB into updates on the EDB. One approach to the view update...
Anthony Tomasic
SUM
2009
Springer
16 years 21 days ago
Query Answering in Belief Logic Programming
Abstract. In this paper we introduce a fixpoint semantics for quantitative logic programming, which is able to both combine and correlate evidence from different sources of infor...
Hui Wan, Michael Kifer
PKDD
2000
Springer
100views Data Mining» more  PKDD 2000»
15 years 9 months ago
Learning Right Sized Belief Networks by Means of a Hybrid Methodology
Previous algoritms for the construction of belief networks structures from data are mainly based either on independence criteria or on scoring metrics. The aim of this paper is to ...
Silvia Acid, Luis M. de Campos