1327 search results - page 35 / 266 » Path following algorithm for the graph matching problem |
109
click to vote
WEA
2004
Springer
15 years 5 months ago
2004
Springer
This paper describes a GRASP with path-relinking heuristic for the quadratic assignment problem. GRASP is a multi-start procedure, where different points in the search space are p...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
ISCIS
2004
Springer
15 years 5 months ago
2004
Springer
Considering wireless sensor networks for border surveillance, one of the major concerns is sensing coverage. Breach probability can be used as a measure to analyze the tradeoffs a...
164
click to vote
ALGORITHMICA
2011
14 years 6 months ago
2011
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
DAGM
2004
Springer
15 years 5 months ago
2004
Springer
A fundamental problem in image recognition is to evaluate the similarity of two images. This can be done by searching for the best pixel-to-pixel matching taking into account suita...