5595 search results - page 336 / 1119 » Approximation Algorithms for Clustering Problems |
182
click to vote
JCO
2011
15 years 1 months ago
2011
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
202
click to vote
HIS
2008
15 years 8 months ago
2008
The class imbalance problem (when one of the classes has much less samples than the others) is of great importance in machine learning, because it corresponds to many critical app...
197
click to vote
INFOCOM
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
161
click to vote
COCOA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract: Recently, there have been significant theoretical progresses towards fixed-parameter algorithms for the DOMINATING SET problem of planar graphs. It is known that the prob...
180
click to vote
ESA
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we study the complexity and approximability of the orthogonal frequency-division multiple access (OFDMA) scheduling problem with uniformly related communication chan...