Sciweavers

96 search results - page 10 / 20
» Approximating the maximum quadratic assignment problem
Sort
View
CPAIOR
2010
Springer
14 years 1 months ago
Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
Madjid Khichane, Patrick Albert, Christine Solnon
IPMI
2007
Springer
14 years 9 months ago
Active Mean Fields: Solving the Mean Field Approximation in the Level Set Framework
Abstract. We describe a new approach for estimating the posterior probability of tissue labels. Conventional likelihood models are combined with a curve length prior on boundaries,...
Kilian M. Pohl, Ron Kikinis, William M. Wells III
CORR
2006
Springer
150views Education» more  CORR 2006»
13 years 8 months ago
The approximability of MAX CSP with fixed-value constraints
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...
Vladimir G. Deineko, Peter Jonsson, Mikael Klasson...
COCOON
1999
Springer
14 years 26 days ago
Multi-coloring Trees
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
Magnús M. Halldórsson, Guy Kortsarz,...
ICCV
2011
IEEE
12 years 8 months ago
Generalized Roof Duality for Pseudo-Boolean Optimization
The number of applications in computer vision that model higher-order interactions has exploded over the last few years. The standard technique for solving such problems is to red...
Fredrik Kahl, Petter Strandmark