23 search results - page 2 / 5 » Optimal Online Prediction in Adversarial Environments |
186
Voted
OSDI
2008
ACM
16 years 6 months ago
2008
ACM
Internet routing is mostly based on static information-it's dynamicity is limited to reacting to changes in topology. Adaptive performance-based routing decisions would not o...
188
Voted
SIGECOM
2010
ACM
15 years 11 months ago
2010
ACM
We study the problem of selling identical goods to n unit-demand bidders in a setting in which the total supply of goods is unknown to the mechanism. Items arrive dynamically, and...
179
Voted
SIGMETRICS
2004
ACM
15 years 12 months ago
2004
ACM
— The volume of multimedia data, including video, served through Peer-to-Peer (P2P) networks is growing rapidly. Unfortunately, high bandwidth transfer rates are rarely available...
182
Voted
ROBOCUP
2001
Springer
15 years 11 months ago
2001
Springer
With the more sophisticated abilities of teams within the simulation league high level online functions become more and more attractive. Last year we proposed an approach to recogn...
179
Voted
SOFSEM
2010
Springer
16 years 3 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...