1064 search results - page 55 / 213 » Exact Algorithms for the Quadratic Linear Ordering Problem |
136
Voted
PG
2007
IEEE
15 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,...
159
Voted
SIAMIS
2010
14 years 10 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
135
Voted
IPL
2008
15 years 4 months ago
2008
In this article we analyze the combination of ACOhg, a new metaheuristic algorithm, plus partial order reduction applied to the problem of finding safety property violations in co...
129
Voted
STACS
2010
Springer
15 years 11 months ago
2010
Springer
In this paper we consider the problem of testing whether two finite groups are isomorphic. Whereas the case where both groups are abelian is well understood and can be solved effi...
129
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
We study the problem of designing kinetic data structures (KDS's for short) when event times cannot be computed exactly and events may be processed in a wrong order. In tradi...