3894 search results - page 320 / 779 » Approximation Algorithms for Biclustering Problems |
171
click to vote
IPCO
2010
15 years 8 months ago
2010
In a column-restricted covering integer program (CCIP), all the non-zero entries of any column of the constraint matrix are equal. Such programs capture capacitated versions of cov...
200
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
171
click to vote
SECON
2007
IEEE
16 years 29 days ago
2007
IEEE
— The coverage and connectivity problem in sensor networks has received significant attention of the research community in the recent years. In this paper, we study this problem...
171
click to vote
STOC
2005
ACM
16 years 7 months ago
2005
ACM
We consider the classical problem of scheduling parallel unrelated machines. Each job is to be processed by exactly one machine. Processing job j on machine i requires time pij . ...
198
click to vote
SIAMJO
2002
15 years 6 months ago
2002
Given an undirected graph with positive weights on the vertices, the maximum weight clique problem (MWCP) is to find a subset of mutually adjacent vertices (i.e., a clique) having ...