3088 search results - page 16 / 618 » Online Passive-Aggressive Algorithms |
STACS
2000
Springer
14 years 15 days ago
2000
Springer
The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total...
JMLR
2012
11 years 11 months ago
2012
In recent years there has been a lot of interest in designing principled classification algorithms over multiple cues, based on the intuitive notion that using more features shou...
AI
1998
Springer
13 years 8 months ago
1998
Springer
In this paper, we address the tradeo between exploration and exploitation for agents which need to learn more about the structure of their environment in order to perform more e e...
KDD
2010
ACM
13 years 6 months ago
2010
ACM
The dynamic marketplace in online advertising calls for ranking systems that are optimized to consistently promote and capitalize better performing ads. The streaming nature of on...
ECIR
2011
Springer
13 years 14 days ago
2011
Springer
Abstract. As retrieval systems become more complex, learning to rank approaches are being developed to automatically tune their parameters. Using online learning to rank approaches...