Sciweavers

1059 search results - page 166 / 212
» Improved Algorithms via Approximations of Probability Distri...
Sort
View
TSMC
2008
146views more  TSMC 2008»
13 years 8 months ago
Decentralized Learning in Markov Games
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is tha...
Peter Vrancx, Katja Verbeeck, Ann Nowé
JAIR
1998
198views more  JAIR 1998»
13 years 8 months ago
Probabilistic Inference from Arbitrary Uncertainty using Mixtures of Factorized Generalized Gaussians
This paper presents a general and efficient framework for probabilistic inference and learning from arbitrary uncertain information. It exploits the calculation properties of fini...
Alberto Ruiz, Pedro E. López-de-Teruel, M. ...
ATAL
2010
Springer
13 years 10 months ago
Quasi deterministic POMDPs and DecPOMDPs
In this paper, we study a particular subclass of partially observable models, called quasi-deterministic partially observable Markov decision processes (QDET-POMDPs), characterize...
Camille Besse, Brahim Chaib-draa
ICDE
2003
IEEE
247views Database» more  ICDE 2003»
14 years 10 months ago
CLUSEQ: Efficient and Effective Sequence Clustering
Analyzing sequence data has become increasingly important recently in the area of biological sequences, text documents, web access logs, etc. In this paper, we investigate the pro...
Jiong Yang, Wei Wang 0010
ALT
2003
Springer
14 years 5 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter