Sciweavers

2990 search results - page 547 / 598
» Hidden Markov processes
Sort
View
AIPS
2007
15 years 2 days ago
Discovering Relational Domain Features for Probabilistic Planning
In sequential decision-making problems formulated as Markov decision processes, state-value function approximation using domain features is a critical technique for scaling up the...
Jia-Hong Wu, Robert Givan
ACMACE
2008
ACM
14 years 11 months ago
AIRSF: a new entertainment adaptive framework for stress free air travels
In this paper, we present a new entertainment adaptive framework AIRSF for stress free air travels. Based on the passenger's current and target comfort states, user entertain...
Hao Liu, Jun Hu, Matthias Rauterberg
ATAL
2008
Springer
14 years 11 months ago
MB-AIM-FSI: a model based framework for exploiting gradient ascent multiagent learners in strategic interactions
Future agent applications will increasingly represent human users autonomously or semi-autonomously in strategic interactions with similar entities. Hence, there is a growing need...
Doran Chakraborty, Sandip Sen
ATAL
2008
Springer
14 years 11 months ago
Expediting RL by using graphical structures
The goal of Reinforcement learning (RL) is to maximize reward (minimize cost) in a Markov decision process (MDP) without knowing the underlying model a priori. RL algorithms tend ...
Peng Dai, Alexander L. Strehl, Judy Goldsmith
CPAIOR
2008
Springer
14 years 11 months ago
Amsaa: A Multistep Anticipatory Algorithm for Online Stochastic Combinatorial Optimization
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
Luc Mercier, Pascal Van Hentenryck