3874 search results - page 187 / 775 » Approximation Algorithms for k-hurdle Problems |
105
click to vote
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a singl...
105
click to vote
COCOA
2008
Springer
15 years 3 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
110
click to vote
ISAAC
2001
Springer
15 years 6 months ago
2001
Springer
A fragmentary pattern is a multiset of non-empty strings, and it matches a string w if all the strings in it occur within w without any overlaps. We study some fundamental issues o...
126
click to vote
ICASSP
2010
IEEE
15 years 2 months ago
2010
IEEE
This paper addresses the problem of locating a single source from noisy range measurements in wireless sensor networks. An approximate solution to the maximum likelihood location ...
120
click to vote
ANOR
2004
15 years 1 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...