Sciweavers

280 search results - page 54 / 56
» Planning for Markov Decision Processes with Sparse Stochasti...
Sort
View
FOCS
2007
IEEE
13 years 11 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
CORR
2012
Springer
193views Education» more  CORR 2012»
12 years 1 months ago
A Unifying Framework for Linearly Solvable Control
Recent work has led to the development of an elegant theory of Linearly Solvable Markov Decision Processes (LMDPs) and related Path-Integral Control Problems. Traditionally, LMDPs...
Krishnamurthy Dvijotham, Emanuel Todorov
AAAI
2006
13 years 6 months ago
Action Selection in Bayesian Reinforcement Learning
My research attempts to address on-line action selection in reinforcement learning from a Bayesian perspective. The idea is to develop more effective action selection techniques b...
Tao Wang
CN
2006
124views more  CN 2006»
13 years 5 months ago
Session based access control in geographically replicated Internet services
Performance critical services over Internet often rely on geographically distributed architectures of replicated servers. Content Delivery Networks (CDN) are a typical example whe...
Novella Bartolini
HRI
2007
ACM
13 years 9 months ago
Efficient model learning for dialog management
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
Finale Doshi, Nicholas Roy