175 search results - page 3 / 35 » Forgetting Reinforced Cases |
FORTE
2010
13 years 7 months ago
2010
Abstract. In this paper, we propose the notion of partial time abstraction for timed process algebras, which introduces the possibility to abstract away parts of the timing of syst...
TIS
2002
13 years 5 months ago
2002
: Modern information systems not only capture a seemingly endless amount of transactional data, but also tend to retain it for indefinite periods of time. We argue that privacy pol...
Publication
In the Bayesian approach to sequential decision making, exact calculation of the (subjective) utility is intractable. This extends to most special cases of interest, such as reinfo...
ICCBR
2009
Springer
14 years 6 days ago
2009
Springer
This work presents a new approach that allows the use of cases in a case base as heuristics to speed up Reinforcement Learning algorithms, combining Case Based Reasoning (CBR) and ...
CORR
2011
Springer
12 years 9 months ago
2011
Springer
In this paper, we confront the problem of applying reinforcement learning to agents that perceive the environment through many sensors and that can perform parallel actions using ...