11910 search results - page 244 / 2382 » Online Learning Algorithms |
151
click to vote
RANDOM
1999
Springer
15 years 10 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
158
click to vote
WDAG
2007
Springer
16 years 19 days ago
2007
Springer
We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a...
193
click to vote
KDD
2004
ACM
16 years 7 months ago
2004
ACM
We propose a new unsupervised learning technique for extracting information from large text collections. We model documents as if they were generated by a two-stage stochastic pro...
294
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
ended abstract summarizes the research presented in Dr. Pardoe’s recently-completed Ph.D. thesis [Pardoe 2011]. The thesis considers how adaptive trading agents can take advantag...
118
click to vote
ISAAC
2009
Springer
16 years 1 months ago
2009
Springer
We investigate a natural online version of the well-known Maximum Directed Cut problem on DAGs. We propose a deterministic algorithm and show that it achieves a competitive ratio o...