175 search results - page 9 / 35 » Forgetting Reinforced Cases |
CAU
2004
13 years 9 months ago
2004
Protecting data is not simply a case of encrypt and forget: even data with full cryptographic confidentiality and integrity protection can still be subject to information leakage. ...
IJCAI
2001
13 years 8 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We introduce ‘atomic flows’: they are graphs obtained from derivations by tracing atom occurrences and forgetting the logical structure. We study simple manipulations of atomi...
ICML
2009
IEEE
14 years 8 months ago
2009
IEEE
We cast model-free reinforcement learning as the problem of maximizing the likelihood of a probabilistic mixture model via sampling, addressing both the infinite and finite horizo...
ATAL
2009
Springer
14 years 2 months ago
2009
Springer
This paper introduces a multiagent reinforcement learning algorithm that converges with a given accuracy to stationary Nash equilibria in general-sum discounted stochastic games. ...