350 search results - page 40 / 70 » Lower bounds and heuristic algorithms for the k |
164
click to vote
ESA
2009
Springer
15 years 10 months ago
2009
Springer
We consider online preemptive scheduling of jobs, arriving one by one, on m identical parallel machines. A buffer of a fixed size K > 0, which assists in partial reordering of...
186
click to vote
INFOCOM
2000
IEEE
15 years 9 months ago
2000
IEEE
The ability to classify packets according to pre-defined rules is critical to providing many sophisticated value-added services, such as security, QoS, load balancing, traffic acco...
168
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
Let R be a set of objects. An object o R is an outlier, if there exist less than k objects in R whose distances to o are at most r. The values of k, r, and the distance metric ar...
150
click to vote
ESA
2009
Springer
16 years 20 days ago
2009
Springer
We study a special class of binary trees. Our results have implications on Maker/Breaker games and SAT: We disprove a conjecture of Beck on positional games and construct an unsati...
167
click to vote
ECRTS
2005
IEEE
15 years 11 months ago
2005
IEEE
We consider the use of the earliest-deadline-first (EDF) scheduling algorithm in soft real-time multiprocessor systems. In hard real-time systems, a significant disparity exists...