3837 search results - page 94 / 768 » Learning Approximate Consistencies |
141
click to vote
FOCS
1992
IEEE
15 years 7 months ago
1992
IEEE
The class PCP(f(n), g(n)) consists of all languages L for which there exists a polynomial-time probabilistic oracle machine that uses O(f(n)) random bits, queries O(g(n)) bits of ...
152
click to vote
ECML
2004
Springer
15 years 9 months ago
2004
Springer
Although tabular reinforcement learning (RL) methods have been proved to converge to an optimal policy, the combination of particular conventional reinforcement learning techniques...
169
click to vote
ICML
2005
IEEE
16 years 5 months ago
2005
IEEE
We introduce a Bayesian model, BayesANIL, that is capable of estimating uncertainties associated with the labeling process. Given a labeled or partially labeled training corpus of...
124
Voted
AAAI
2008
15 years 6 months ago
2008
Off-policy reinforcement learning is aimed at efficiently reusing data samples gathered in the past, which is an essential problem for physically grounded AI as experiments are us...
166
click to vote
COMBINATORICA
2010
14 years 11 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...