115 search results - page 1 / 23 » New Benchmark Instances for the QAP and the Experimental Ana... |
EVOW
2004
Springer
13 years 10 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 ...
MICCAI
2007
Springer
14 years 5 months ago
2007
Springer
This paper introduces a new benchmark study of evaluating landmark-based shape correspondence used for statistical shape analysis. Different from previous shape-correspondence eval...
PAMI
2008
13 years 4 months ago
2008
This paper introduces a new benchmark study to evaluate the performance of landmark-based shape correspondence used for statistical shape analysis. Different from previous shape-co...
ICCAD
1996
IEEE
13 years 8 months ago
1996
IEEE
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed searchp...
ALGORITHMICA
2002
13 years 4 months ago
2002
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...