376 search results - page 49 / 76 » On the Advice Complexity of Online Problems |
118
click to vote
ALGORITHMICA
2000
14 years 11 months ago
2000
We study the problem of minimizing the expected cost of binary searching for data where the access cost is not fixed and depends on the last accessed element, such as data stored i...
106
Voted
LION
2007
Springer
15 years 5 months ago
2007
Springer
This paper is about Reinforcement Learning (RL) applied to online parameter tuning in Stochastic Local Search (SLS) methods. In particular a novel application of RL is considered i...
117
click to vote
LWA
2007
15 years 1 months ago
2007
Typical conversational recommender systems support interactive strategies that are hard-coded in advance and followed rigidly during a recommendation session. In fact, Reinforceme...
JAPLL
2008
14 years 11 months ago
2008
In this paper, we study the following basic problem: After having executed a sequence of actions, find a sequence of actions that brings the agent back to the state just before th...
HPCA
2004
IEEE
16 years 2 days ago
2004
IEEE
As microprocessors become increasingly complex, the techniques used to analyze and predict their behavior must become increasingly rigorous. This paper applies wavelet analysis te...