221 search results - page 24 / 45 » Nine Ways to Find a Solution |
106
click to vote
AOSD
2007
ACM
15 years 3 months ago
2007
ACM
In order to increase the productivity of the application developers, it is desirable to remove the persistence concern from their responsibility. For this purpose, the orthogonal ...
96
Voted
ATMOS
2008
15 years 1 months ago
2008
Abstract. Recently, the recoverable robustness model has been introduced in the optimization area. This model allows to consider disruptions (input data changes) in a unified way, ...
107
click to vote
CVIU
2008
2008
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
14 years 12 months ago
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
HEURISTICS
2006
14 years 11 months ago
2006
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
113
click to vote
IWPEC
2010
Springer
14 years 9 months ago
2010
Springer
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...