725 search results - page 29 / 145 » Smoothed Analysis of Algorithms and Heuristics |
EVOW
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a ...
INFOCOM
2011
IEEE
14 years 1 months ago
2011
IEEE
—This paper develops a mesh network protection scheme that guarantees a quantifiable minimum grade of service upon a failure within a network. The scheme guarantees that a fract...
CVPR
2007
IEEE
15 years 12 months ago
2007
IEEE
State-of-the-art stereo vision algorithms utilize color changes as important cues for object boundaries. Most methods impose heuristic restrictions or priors on disparities, for e...
NJC
1998
14 years 9 months ago
1998
The problem of routing permutations on graphs via matchings is considered, and we present a general algorithm which can be parameterized by different heuristics. This leads to a ...
ISNN
2007
Springer
15 years 4 months ago
2007
Springer
Nonnegative Matrix and Tensor Factorization (NMF/NTF) and Sparse Component Analysis (SCA) have already found many potential applications, especially in multi-way Blind Source Separ...