Sciweavers

983 search results - page 62 / 197
» A Better Update Policy
Sort
View
IJCAI
2003
13 years 10 months ago
A General Model for Online Probabilistic Plan Recognition
We present a new general framework for online istic plan recognition called the Abstract Hidden Markov Memory Model (AHMEM). The l is an extension of the existing Abstract Hidden ...
Hung Hai Bui
IAT
2009
IEEE
14 years 3 months ago
Introducing Communication in Dis-POMDPs with Finite State Machines
Distributed Partially Observable Markov Decision Problems (DisPOMDPs) are emerging as a popular approach for modeling sequential decision making in teams operating under uncertain...
Yuki Iwanari, Makoto Tasaki, Makoto Yokoo, Atsushi...
CORR
2006
Springer
113views Education» more  CORR 2006»
13 years 8 months ago
A Unified View of TD Algorithms; Introducing Full-Gradient TD and Equi-Gradient Descent TD
This paper addresses the issue of policy evaluation in Markov Decision Processes, using linear function approximation. It provides a unified view of algorithms such as TD(), LSTD()...
Manuel Loth, Philippe Preux
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 11 days ago
Decentralized Online Learning Algorithms for Opportunistic Spectrum Access
—The fundamental problem of multiple secondary users contending for opportunistic spectrum access over multiple channels in cognitive radio networks has been formulated recently ...
Yi Gai, Bhaskar Krishnamachari
INFOCOM
2009
IEEE
14 years 3 months ago
Distributed Storage Management of Evolving Files in Delay Tolerant Ad Hoc Networks
— This work focuses on a class of distributed storage systems whose content may evolve over time. Each component or node of the storage system is mobile and the set of all nodes ...
Eitan Altaian, Philippe Nain, Jean-Claude Bermond