2698 search results - page 248 / 540 » Approximation Algorithms for the Weighted Independent Set Pr... |
166
click to vote
IDA
2008
Springer
15 years 6 months ago
2008
Springer
Meta-heuristics such as simulated annealing, genetic algorithms and tabu search have been successfully applied to many difficult optimization problems for which no satisfactory pro...
303
click to vote
PODS
2009
ACM
16 years 7 months ago
2009
ACM
Database technology is playing an increasingly important role in understanding and solving large-scale and complex scientific and societal problems and phenomena, for instance, un...
180
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...
176
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...
170
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...