2750 search results - page 65 / 550 » The complexity of learning SUBSEQ(A) |
161
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
In this paper we present a novel algorithm, CarpeDiem. It significantly improves on the time complexity of Viterbi algorithm, preserving the optimality of the result. This fact ha...
160
click to vote
KCAP
2005
ACM
15 years 11 months ago
2005
ACM
We present a framework for knowledge transfer from one reinforcement learning task to a related task through advicetaking mechanisms. We discuss the importance of transfer in comp...
150
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
The learning in a niche based learning classifier system depends both on the complexity of the problem space and on the number of available actions. In this paper, we introduce a ...
141
click to vote
IJHIS
2008
15 years 6 months ago
2008
Meta-Learning has been successfully applied to acquire knowledge used to support the selection of learning algorithms. Each training example in Meta-Learning (i.e. each meta-exampl...
160
click to vote
COCO
2010
Springer
15 years 10 months ago
2010
Springer
Abstract—We consider two natural extensions of the communication complexity model that are inspired by distributed computing. In both models, two parties are equipped with synchr...