94 search results - page 1 / 19 » Generation of Tree Decompositions by Iterated Local Search |
EVOW
2007
Springer
13 years 11 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
EVOW
2010
Springer
13 years 8 months ago
2010
Springer
Instances of constraint satisfaction problems can be solved efficiently if they are representable as a tree decomposition of small width. Unfortunately, the task of finding a deco...
GECCO
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Iterated local search (ILS) is a powerful meta-heuristic algorithm applied to a large variety of combinatorial optimization problems. Contrary to evolutionary algorithms ...
DAC
1999
ACM
14 years 5 months ago
1999
ACM
CVPR
2005
IEEE
14 years 6 months ago
2005
IEEE
Recently, nonlinear shape models have been shown to improve the robustness and flexibility of segmentation. In this paper, we propose Shape Regularized Active Contour (ShRAC) that...