5595 search results - page 491 / 1119 » Approximation Algorithms for Clustering Problems |
234
click to vote
GECCO
2008
Springer
15 years 8 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...
246
click to vote
BMCBI
2011
14 years 11 months ago
2011
Background: The search for cluster structure in microarray datasets is a base problem for the so-called “-omic sciences”. A difficult problem in clustering is how to handle da...
200
click to vote
SECON
2007
IEEE
16 years 2 months 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...
195
click to vote
STOC
2005
ACM
16 years 8 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 . ...
225
click to vote
SIAMJO
2002
15 years 7 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 ...