98 search results - page 2 / 20 » Cut-and-solve: An iterative search strategy for combinatoria... |
CVPR
2005
IEEE
14 years 9 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...
GECCO
2004
Springer
14 years 25 days 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 ...
GECCO
2005
Springer
14 years 1 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
EOR
2006
13 years 7 months ago
2006
A tabu search approach to solve multi-objective combinatorial optimization problems is developed in this paper. This procedure selects an objective to become active for a given it...
EOR
2002
13 years 7 months ago
2002
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...