7150 search results - page 87 / 1430 » An Approximation Algorithm for Approximation Rank |
SIAMCOMP
2010
14 years 7 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
116
click to vote
SODA
2001
ACM
15 years 2 months ago
2001
ACM
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
97
Voted
DGCI
2009
Springer
15 years 5 months ago
2009
Springer
Abstract. The exact, subpixel watershed algorithm delivers very accurate watershed boundaries based on a spline interpolation, but is slow and only works in 2D. On the other hand, ...
131
click to vote
ASAP
2004
IEEE
15 years 4 months ago
2004
IEEE
Dynamic programming for approximate string matching is a large family of different algorithms, which vary significantly in purpose, complexity, and hardware utilization. Many impl...
113
click to vote
CDC
2010
IEEE
14 years 7 months ago
2010
IEEE
We consider a multi-agent optimization problem where agents aim to cooperatively minimize a sum of local objective functions subject to a global inequality constraint and a global ...