450 search results - page 21 / 90 » Adaptive Algorithms for Online Decision Problems |
154
Voted
ALT
2005
Springer
16 years 16 days ago
2005
Springer
This paper shows how universal learning can be achieved with expert advice. To this aim, we specify an experts algorithm with the following characteristics: (a) it uses only feedba...
130
Voted
AAAI
2007
15 years 6 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
141
Voted
SOFSEM
2010
Springer
16 years 14 days ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
120
click to vote
EWRL
2008
15 years 5 months ago
2008
Abstract. We consider a control problem where the decision maker interacts with a standard Markov decision process with the exception that the reward functions vary arbitrarily ove...
154
Voted
CLUSTER
2002
IEEE
15 years 3 months ago
2002
IEEE
Abstract. We describe and evaluate the Running Time Advisor (RTA), a system that can predict the running time of a compute-bound task on a typical shared, unreserved commodity host...