3837 search results - page 66 / 768 » Learning Approximate Consistencies |
134
click to vote
ENGL
2007
15 years 1 months ago
2007
—“A General Reflex Fuzzy Min-Max Neural Network” (GRFMN) is presented. GRFMN is capable to extract the underlying structure of the data by means of supervised, unsupervised a...
131
Voted
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
It is known that the complexity of the reinforcement learning algorithms, such as Q-learning, may be exponential in the number of environment’s states. It was shown, however, th...
154
click to vote
ISAAC
2005
Springer
15 years 7 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
115
click to vote
ML
2002
ACM
15 years 1 months ago
2002
ACM
TD() is a popular family of algorithms for approximate policy evaluation in large MDPs. TD() works by incrementally updating the value function after each observed transition. It h...
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
This paper investigates the problem of automatically learning how to restructure the reward function of a Markov decision process so as to speed up reinforcement learning. We begi...