4698 search results - page 82 / 940 » Making Functionality More General |
109
click to vote
AAMAS
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we investigate the use of parallelization in reinforcement learning (RL), with the goal of learning optimal policies for single-agent RL problems more quickly by us...
149
click to vote
AAAI
2006
15 years 4 months ago
2006
Reinforcement learning problems are commonly tackled with temporal difference methods, which attempt to estimate the agent's optimal value function. In most real-world proble...
104
click to vote
ICANN
2007
Springer
15 years 9 months ago
2007
Springer
Support Vector Machines (SVMs) for classification tasks produce sparse models by maximizing the margin. Two limitations of this technique are considered in this work: firstly, th...
126
click to vote
FSTTCS
2006
Springer
15 years 6 months ago
2006
Springer
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper...
133
click to vote
DAGSTUHL
2006
15 years 4 months ago
2006
Cryptographic Boolean functions must be complex to satisfy Shannon's principle of confusion. But the cryptographic viewpoint on complexity is not the same as in circuit compl...