114 search results - page 2 / 23 » Mind Change Complexity of Learning Logic Programs |
AISADM
2005
Springer
13 years 10 months ago
2005
Springer
Computer programming of complex systems is a time consuming effort. Results are often brittle and inflexible. Evolving, self-learning flexible multi-agent systems remain a distant ...
LFCS
1992
Springer
13 years 8 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 ...
COLT
1999
Springer
13 years 8 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
COLT
1992
Springer
13 years 8 months ago
1992
Springer
Machine learning of limit programs (i.e., programs allowed finitely many mind changes about their legitimate outputs) for computable functions is studied. Learning of iterated lim...
FPGA
2001
ACM
13 years 9 months ago
2001
ACM
As the complexity of integrated circuits increases, the ability to make post-fabrication changes to fixed ASIC chips will become more and more attractive. This ability can be real...