3088 search results - page 76 / 618 » Online Passive-Aggressive Algorithms |
FSTTCS
2000
Springer
15 years 1 months ago
2000
Springer
We investigate a variant of on-line edge-coloring in which there is a fixed number of colors availableandtheaimistocolorasmanyedgesaspossible.Weproveupperandlowerboundsontheperform...
MFCS
1994
Springer
15 years 1 months ago
1994
Springer
We consider the question of lookahead in the list update problem: What improvement can be achieved in terms of competitiveness if an on-line algorithm sees not only the present re...
RANDOM
1999
Springer
15 years 2 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...
WDAG
2007
Springer
15 years 3 months 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...
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We study online learning in an oblivious changing environment. The standard measure of regret bounds the difference between the cost of the online learner and the best decision in...