3837 search results - page 62 / 768 » Learning Approximate Consistencies |
107
click to vote
ICANN
2007
Springer
15 years 8 months ago
2007
Springer
Finding the largest linearly separable set of examples for a given Boolean function is a NP-hard problem, that is relevant to neural network learning algorithms and to several prob...
116
click to vote
ALT
2006
Springer
15 years 11 months ago
2006
Springer
Abstract. The present study aims at insights into the nature of incremental learning in the context of Gold’s model of identification in the limit. With a focus on natural requi...
121
click to vote
NIPS
2003
15 years 3 months ago
2003
Recent research has demonstrated that useful POMDP solutions do not require consideration of the entire belief space. We extend this idea with the notion of temporal abstraction. ...
107
click to vote
JANCL
2002
15 years 1 months ago
2002
ABSTRACT. It has long been recognized that the concept of inconsistency is a central part of commonsense reasoning. In this issue, a number of authors have explored the idea of rea...
104
click to vote
ESANN
2006
15 years 3 months ago
2006
We focus on neuro-dynamic programming methods to learn state-action value functions and outline some of the inherent problems to be faced, when performing reinforcement learning in...