766 search results - page 8 / 154 » Online Variance Minimization |
TARK
2007
Springer
14 years 1 months ago
2007
Springer
We relate regret minimization to various online learning tasks, and most notable option pricing.
WDAG
2007
Springer
14 years 1 months ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
IPL
2006
13 years 7 months ago
2006
We consider the online scheduling problem with m - 1, m 2, uniform machines each with a processing speed of 1, and one machine with a speed of s, 1 s 2, to minimize the makespa...
SPAA
2005
ACM
14 years 28 days ago
2005
ACM
We study the admission control problem in general networks. Communication requests arrive over time, and the online algorithm accepts or rejects each request while maintaining the...
SOFSEM
2010
Springer
14 years 4 months 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...