16404 search results - page 439 / 3281 » A set coverage problem |
180
click to vote
DCC
2002
IEEE
16 years 6 months ago
2002
IEEE
We show that the problem of optimal bit allocation among a set of independent discrete quantizers given a budget constraint is equivalent to the multiple choice knapsack problem (...
126
Voted
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Abstract. In this paper, we consider parallelizability of some Pcomplete problems. First we propose a parameter which indicates parallelizability for a convex layers problem. We pr...
165
click to vote
SAC
1997
ACM
15 years 11 months ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...
177
click to vote
EOR
2010
15 years 6 months ago
2010
This paper investigates the integration of the employee timetabling and production scheduling problems. At the first level, we manage a classical employee timetabling problem. At ...
184
Voted
DISOPT
2007
15 years 6 months ago
2007
We investigate the computational complexity of a combinatorial problem that arises in DNA sequencing by hybridization: The input consists of an integer together with a set S of wo...