220 search results - page 39 / 44 » Minimizing Average Flow-time : Upper and Lower Bounds |
165
click to vote
FOCS
2007
IEEE
16 years 29 days ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...
136
click to vote
COMBINATORICS
2000
15 years 6 months ago
2000
Given a space endowed with symmetry, we define ms(, r) to be the maximum of m such that for any r-coloring of there exists a monochromatic symmetric set of size at least m. We c...
159
click to vote
VTC
2007
IEEE
16 years 27 days ago
2007
IEEE
—This paper presents an opportunistic feedback (OF) protocol that achieves the asymptotic sum-capacity of the fading broadcast channel (BC) with a limited amount of feedback. The...
173
click to vote
EOR
2006
15 years 6 months ago
2006
This paper considers a project scheduling problem with the objective of minimizing resource availability costs, taking into account a deadline for the project and precedence relat...
180
click to vote
DAC
1995
ACM
15 years 10 months ago
1995
ACM
In this paper we present a set cover based approach (SCP) to multi-way partitioning for minimum delay for Look-Up Table based FPGAs. SCP minimizes the number of chip-crossings on ...