Sciweavers

252 search results - page 19 / 51
» Learning Partially Observable Action Models: Efficient Algor...
Sort
View
99
Voted
HASE
2008
IEEE
15 years 9 months ago
Small Logs for Transactional Services: Distinction is Much More Accurate than (Positive) Discrimination
For complex services, logging is an integral part of many middleware aspects, especially, transactions and monitoring. In the event of a failure, the log allows us to deduce the c...
Debmalya Biswas, Thomas Gazagnaire, Blaise Genest
141
Voted
ATAL
2006
Springer
15 years 6 months ago
Learning to commit in repeated games
Learning to converge to an efficient, i.e., Pareto-optimal Nash equilibrium of the repeated game is an open problem in multiagent learning. Our goal is to facilitate the learning ...
Stéphane Airiau, Sandip Sen
114
Voted
ICML
2004
IEEE
16 years 3 months ago
Learning and discovery of predictive state representations in dynamical systems with reset
Predictive state representations (PSRs) are a recently proposed way of modeling controlled dynamical systems. PSR-based models use predictions of observable outcomes of tests that...
Michael R. James, Satinder P. Singh
ALT
2005
Springer
15 years 11 months ago
Defensive Universal Learning with Experts
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
Jan Poland, Marcus Hutter
IJCAI
2003
15 years 3 months ago
Taming Decentralized POMDPs: Towards Efficient Policy Computation for Multiagent Settings
The problem of deriving joint policies for a group of agents that maximize some joint reward function can be modeled as a decentralized partially observable Markov decision proces...
Ranjit Nair, Milind Tambe, Makoto Yokoo, David V. ...