11910 search results - page 299 / 2382 » Online Learning Algorithms |
185
click to vote
APPROX
2000
Springer
15 years 11 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
280
click to vote
FODO
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. A Conceptual Information System consists of a database together with conceptual hierarchies. The management system TOSCANA visualizes arbitrary combinations of conceptual...
207
click to vote
COMPGEOM
1992
ACM
15 years 10 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...
185
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
We study the problem of scheduling permanent jobs on unrelated machines when the objective is to minimize the Lp norm of the machine loads. The problem is known as load balancing ...