3088 search results - page 104 / 618 » Online Passive-Aggressive Algorithms |
AAAI
2008
15 years 5 days ago
2008
We examine online learning in the context of the Wisconsin Card Sorting Task (WCST), a task for which the concept acquisition strategies for human and other primates are well docu...
APPROX
2000
Springer
15 years 2 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 ...
139
click to vote
FODO
1998
Springer
15 years 2 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...
121
click to vote
COMPGEOM
1992
ACM
15 years 1 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...
SODA
2008
ACM
14 years 11 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 ...