220 search results - page 31 / 44 » Minimizing Average Flow-time : Upper and Lower Bounds |
JCT
2011
13 years 3 months ago
2011
This article is devoted to the study of continuous colorings of the n-element subsets of a Polish space. The homogeneity number hm(c) of an n-coloring c : [X]n → 2 is the least s...
SIAMCOMP
2002
13 years 8 months ago
2002
We consider the problem of maintaining aggregates and statistics over data streams, with respect to the last N data elements seen so far. We refer to this model as the sliding wind...
APPROX
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Scheduling jobs on unrelated parallel machines so as to minimize the makespan is one of the basic, well-studied problems in the area of machine scheduling. In the first ...
IWCMC
2009
ACM
14 years 2 months ago
2009
ACM
This paper addresses the problem of optimal cooperative spectrum sensing in a cognitive-enabled sensor network where cognitive sensors can cooperate in the sensing of the spectrum...
WWW
2006
ACM
14 years 9 months ago
2006
ACM
We study how to design experiments to measure the success rates of phishing attacks that are ethical and accurate, which are two requirements of contradictory forces. Namely, an e...