376 search results - page 32 / 76 » On the Advice Complexity of Online Problems |
136
click to vote
PKDD
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
198
click to vote
ICLP
2009
Springer
16 years 12 days ago
2009
Springer
We study finding similar or diverse solutions of a given computational problem, in answer set programming, and introduce offline methods and online methods to compute them using an...
ESA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. Most recent papers addressing the algorithmic problem of allocating advertisement space for keywords in sponsored search auctions assume that pricing is done via a first...
ECAI
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
SACMAT
2004
ACM
15 years 5 months ago
2004
ACM
In the era of Ubiquitous Computing and world–wide data transfer mobility, as an innovative aspect of professional activities, imposes new and complex problems of mobile and dist...