Sciweavers

355 search results - page 35 / 71
» Online Learning and Exploiting Relational Models in Reinforc...
Sort
View
UAI
2008
14 years 11 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
ETS
2006
IEEE
114views Hardware» more  ETS 2006»
14 years 9 months ago
From Research Resources to Learning Objects: Process Model and Virtualization Experiences
Typically, most research and academic institutions own and archive a great amount of objects and research related resources that have been produced, used and maintained over long ...
José Luis Sierra, Alfredo Fernández-...
ICMCS
2008
IEEE
145views Multimedia» more  ICMCS 2008»
15 years 4 months ago
Video search reranking via online ordinal reranking
To exploit co-occurrence patterns among features and target semantics while keeping the simplicity of the keywordbased visual search, a novel reranking methods is proposed. The ap...
Yi-Hsuan Yang, Winston H. Hsu
ICANN
2005
Springer
15 years 3 months ago
A Neural Network Model for Inter-problem Adaptive Online Time Allocation
One aim of Meta-learning techniques is to minimize the time needed for problem solving, and the effort of parameter hand-tuning, by automating algorithm selection. The predictive m...
Matteo Gagliolo, Jürgen Schmidhuber
SIGIR
2011
ACM
14 years 17 days ago
Collaborative competitive filtering: learning recommender using context of user choice
While a user’s preference is directly reflected in the interactive choice process between her and the recommender, this wealth of information was not fully exploited for learni...
Shuang-Hong Yang, Bo Long, Alexander J. Smola, Hon...