Sciweavers

267 search results - page 17 / 54
» Efficient and decentralized computation of approximate globa...
Sort
View
ATAL
2007
Springer
15 years 6 months ago
Commitment-driven distributed joint policy search
Decentralized MDPs provide powerful models of interactions in multi-agent environments, but are often very difficult or even computationally infeasible to solve optimally. Here we...
Stefan J. Witwicki, Edmund H. Durfee
ECML
2006
Springer
15 years 3 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
AINA
2005
IEEE
15 years 5 months ago
Global Connectivity for Mobile IPv6-Based Ad Hoc Networks
The IPv6-enabled network architecture has recently attracted much attention. In this paper, we address the issue of connecting MANETs to global IPv6 networks while supporting IPv6...
Chiung-Ying Wang, Cheng-Ying Li, Ren-Hung Hwang, Y...
UAI
2008
15 years 1 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
ECCV
2008
Springer
16 years 1 months ago
Efficiently Learning Random Fields for Stereo Vision with Sparse Message Passing
As richer models for stereo vision are constructed, there is a growing interest in learning model parameters. To estimate parameters in Markov Random Field (MRF) based stereo formu...
Jerod J. Weinman, Lam Tran, Christopher J. Pal