340 search results - page 33 / 68 » Clustering with Lower Bound on Similarity |
159
click to vote
SIGMETRICS
2005
ACM
15 years 11 months ago
2005
ACM
We define the class of SMART scheduling policies. These are policies that bias towards jobs with small remaining service times, jobs with small original sizes, or both, with the ...
162
click to vote
ICALP
2004
Springer
15 years 11 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...
131
click to vote
BMCBI
2008
15 years 6 months ago
2008
Background: DNA microarrays, which determine the expression levels of tens of thousands of genes from a sample, are an important research tool. However, the volume of data they pr...
170
click to vote
FSTTCS
2010
Springer
15 years 4 months ago
2010
Springer
This paper describes a project that aims at showing that propositional proofs of certain tautologies in weak proof system give upper bounds on the computational complexity of func...
177
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Herman’s algorithm is a synchronous randomized protocol for achieving self-stabilization in a token ring consisting of N processes. The interaction of tokens makes the dynamics o...