175 search results - page 14 / 35 » Forgetting Reinforced Cases |
IAT
2008
IEEE
13 years 7 months ago
2008
IEEE
While context-awareness has been found to be effective for decision support in complex domains, most of such decision support systems are hard-coded, incurring significant develop...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
The paper explores a very simple agent design method called Q-decomposition, wherein a complex agent is built from simpler subagents. Each subagent has its own reward function and...
ILP
2007
Springer
14 years 1 months ago
2007
Springer
In reinforcement learning problems, an agent has the task of learning a good or optimal strategy from interaction with his environment. At the start of the learning task, the agent...
IROS
2009
IEEE
14 years 2 months ago
2009
IEEE
— Partially Observable Markov Decision Processes (POMDPs) provide a rich mathematical model to handle realworld sequential decision processes but require a known model to be solv...
NIPS
1993
13 years 8 months ago
1993
Parti-game is a new algorithm for learning feasible trajectories to goal regions in high dimensionalcontinuousstate-spaces. In high dimensions it is essential that learningdoes not...