567 search results - page 13 / 114 » Learning All Subfunctions of a Function |
LFCS
1992
Springer
13 years 11 months ago
1992
Springer
A generator program for a computable function (by definition) generates an infinite sequence of programs all but finitely many of which compute that function. Machine learning of ...
KI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We compare three systems for the task of synthesising functional recursive programs, namely Adate, an approach through evolutionary computation, the classification learn...
CORR
2012
Springer
12 years 3 months ago
2012
Springer
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
AAAI
2007
13 years 9 months ago
2007
We consider a resource selection game with incomplete information about the resource-cost functions. All the players know is the set of players, an upper bound on the possible cos...
ECTEL
2009
Springer
13 years 5 months ago
2009
Springer
Abstract. Current Learning Management Systems were typically conceived to offer a self-contained "one size fits all" learning environment. Adaptive educational systems ha...