Sciweavers

499 search results - page 36 / 100
» Model Minimization in Markov Decision Processes
Sort
View
ICML
2006
IEEE
14 years 9 months ago
An intrinsic reward mechanism for efficient exploration
How should a reinforcement learning agent act if its sole purpose is to efficiently learn an optimal policy for later use? In other words, how should it explore, to be able to exp...
Özgür Simsek, Andrew G. Barto
AAAI
2007
13 years 11 months ago
Situated Conversational Agents
A Situated Conversational Agent (SCA) is an agent that engages in dialog about the context within which it is embedded. Situated dialog is characterized by its deep connection to ...
William Thompson
IJCAI
2007
13 years 10 months ago
A Hybridized Planner for Stochastic Domains
Markov Decision Processes are a powerful framework for planning under uncertainty, but current algorithms have difficulties scaling to large problems. We present a novel probabil...
Mausam, Piergiorgio Bertoli, Daniel S. Weld
AAAI
1994
13 years 10 months ago
Acting Optimally in Partially Observable Stochastic Domains
In this paper, we describe the partially observable Markov decision process pomdp approach to nding optimal or near-optimal control strategies for partially observable stochastic ...
Anthony R. Cassandra, Leslie Pack Kaelbling, Micha...
ICVS
2001
Springer
14 years 1 months ago
Adapting Object Recognition across Domains: A Demonstration
High-level vision systems use object, scene or domain specific knowledge to interpret images. Unfortunately, this knowledge has to be acquired for every domain. This makes it diffi...
Bruce A. Draper, Ulrike Ahlrichs, Dietrich Paulus