5214 search results - page 252 / 1043 » The Online Specialization Problem |
152
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
We study on-line decision problems where the set of actions that are available to the decision algorithm vary over time. With a few notable exceptions, such problems remained larg...
144
Voted
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
167
click to vote
WWW
2008
ACM
16 years 6 months ago
2008
ACM
Motivated by several marketplace applications on rapidly growing online social networks, we study the problem of efficient offline matching algorithms for online exchange markets....
157
click to vote
IPCO
2007
15 years 7 months ago
2007
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
165
click to vote
WWW
2007
ACM
16 years 6 months ago
2007
ACM
Given a large online network of online auction users and their histories of transactions, how can we spot anomalies and auction fraud? This paper describes the design and implemen...