Sciweavers

3837 search results - page 7 / 768
» Learning Approximate Consistencies
Sort
View
95
Voted
JDA
2010
94views more  JDA 2010»
15 years 2 months ago
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
Jaroslaw Byrka, Pawel Gawrychowski, Katharina T. H...
UAI
2008
15 years 5 months ago
Learning and Solving Many-Player Games through a Cluster-Based Representation
In addressing the challenge of exponential scaling with the number of agents we adopt a cluster-based representation to approximately solve asymmetric games of very many players. ...
Sevan G. Ficici, David C. Parkes, Avi Pfeffer
116
Voted
IJCAI
2007
15 years 5 months ago
Learning from Partial Observations
We present a general machine learning framework for modelling the phenomenon of missing information in data. We propose a masking process model to capture the stochastic nature of...
Loizos Michael
158
Voted
JMLR
2010
140views more  JMLR 2010»
14 years 10 months ago
Mean Field Variational Approximation for Continuous-Time Bayesian Networks
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
Ido Cohn, Tal El-Hay, Nir Friedman, Raz Kupferman
130
Voted
ATAL
2005
Springer
15 years 9 months ago
Approximating state estimation in multiagent settings using particle filters
State estimation consists of updating an agent’s belief given executed actions and observed evidence to date. In single agent environments, the state estimation can be formalize...
Prashant Doshi, Piotr J. Gmytrasiewicz