Sciweavers

805 search results - page 81 / 161
» Enumerating All Solutions for Constraint Satisfaction Proble...
Sort
View
ECAI
2004
Springer
15 years 10 months ago
Postponing Branching Decisions
Abstract. Solution techniques for Constraint Satisfaction and Optimisation Problems often make use of backtrack search methods, exploiting variable and value ordering heuristics. I...
Willem Jan van Hoeve, Michela Milano
COR
2010
150views more  COR 2010»
15 years 4 months ago
Black box scatter search for general classes of binary optimization problems
The purpose of this paper is to apply the scatter search methodology to general classes of binary problems. We focus on optimization problems for which the solutions are represent...
Francisco Gortázar, Abraham Duarte, Manuel ...
TIP
2008
109views more  TIP 2008»
15 years 4 months ago
Iterative Rate-Distortion Optimization of H.264 With Constant Bit Rate Constraint
In this paper, we apply the primal-dual decomposition and subgradient projection methods to solve the rate-distortion optimization problem with the constant bit rate constraint. Th...
Cheolhong An, Truong Q. Nguyen
FOCS
2000
IEEE
15 years 8 months ago
Approximating the single source unsplittable min-cost flow problem
Abstract. In the single source unsplittable min-cost flow problem, commodities must be routed simultaneously from a common source vertex to certain destination vertices in a given ...
Martin Skutella
CONSTRAINTS
2002
129views more  CONSTRAINTS 2002»
15 years 4 months ago
Cost-Based Arc Consistency for Global Cardinality Constraints
A global cardinality constraint (gcc) is specified in terms of a set of variables X = {x1, ..., xp} which take their values in a subset of V = {v1, ..., vd}. It constrains the numb...
Jean-Charles Régin