PG
2007
IEEE
13 years 10 months ago
2007
IEEE
We formulate contour correspondence as a Quadratic Assignment Problem (QAP), incorporating proximity information. By maintaining the neighborhood relation between points this way,...
CISS
2008
IEEE
13 years 11 months ago
2008
IEEE
—The error floor of bit-interleaved coded modulation with iterative decoding (BICM-ID) can be minimized for a particular constellation by maximizing the harmonic mean of the squ...
ASIAMS
2008
IEEE
13 years 11 months ago
2008
IEEE
The multiobjective Quadratic Assignment Problem (mQAP) is considered as one of the hardest optimization problems but with many real-world applications. Since it may not be possibl...
SODA
2010
ACM
14 years 1 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...