2750 search results - page 78 / 550 » The complexity of learning SUBSEQ(A) |
157
click to vote
STOC
1994
ACM
15 years 10 months ago
1994
ACM
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
169
click to vote
FUIN
2008
15 years 4 months ago
2008
Causal relations are present in many application domains. Causal Probabilistic Logic (CP-logic) is a probabilistic modeling language that is especially designed to express such rel...
166
click to vote
ROBOCUP
2009
Springer
16 years 21 days ago
2009
Springer
As the reach of multiagent reinforcement learning extends to more and more complex tasks, it is likely that the diverse challenges posed by some of these tasks can only be address...
225
click to vote
ESANN
2008
15 years 7 months ago
2008
In this paper the application of reinforcement learning to Tetris is investigated, particulary the idea of temporal difference learning is applied to estimate the state value funct...
190
click to vote
CI
2005
15 years 6 months ago
2005
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...