Sciweavers

2354 search results - page 77 / 471
» Randomness, Stochasticity and Approximations
Sort
View
AAAI
2011
12 years 9 months ago
Pushing the Power of Stochastic Greedy Ordering Schemes for Inference in Graphical Models
We study iterative randomized greedy algorithms for generating (elimination) orderings with small induced width and state space size - two parameters known to bound the complexity...
Kalev Kask, Andrew Gelfand, Lars Otten, Rina Decht...
JAIR
2008
113views more  JAIR 2008»
13 years 9 months ago
Graphical Model Inference in Optimal Control of Stochastic Multi-Agent Systems
In this article we consider the issue of optimal control in collaborative multi-agent systems with stochastic dynamics. The agents have a joint task in which they have to reach a ...
Bart van den Broek, Wim Wiegerinck, Bert Kappen
NIPS
2003
13 years 10 months ago
Bounded Finite State Controllers
We describe a new approximation algorithm for solving partially observable MDPs. Our bounded policy iteration approach searches through the space of bounded-size, stochastic fini...
Pascal Poupart, Craig Boutilier
PROCEDIA
2010
123views more  PROCEDIA 2010»
13 years 7 months ago
Mean square convergence of a semidiscrete scheme for SPDEs of Zakai type driven by square integrable martingales
In this short note, a direct proof of L2 convergence of an Euler–Maruyama approximation of a Zakai equation driven by a square integrable martingale is shown. The order of conve...
Annika Lang
CIE
2009
Springer
14 years 3 months ago
Computable Exchangeable Sequences Have Computable de Finetti Measures
Abstract. We prove a uniformly computable version of de Finetti’s theorem on exchangeable sequences of real random variables. In the process, we develop machinery for computably ...
Cameron E. Freer, Daniel M. Roy