1429 search results - page 31 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
GECCO
2010
Springer
13 years 8 months ago
2010
Springer
Evolutionary algorithms (EAs) are increasingly being applied to solve real-parameter optimization problems due to their flexibility in handling complexities such as non-convexity,...
ICCS
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
TSP
2008
13 years 7 months ago
2008
Carrier frequency offset (CFO) mitigation is critical for orthogonal frequency-division multiplexing (OFDM)-based cooperative transmissions because even small CFO per transmitter m...
APPROX
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketc...
IPL
2008
13 years 7 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...