1300 search results - page 189 / 260 » Constraint satisfaction problems and global cardinality cons... |
CSCLP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. In this paper we develop a localized value-ordering heuristic for distributed resource allocation problems. We show how this value ordering heuristics can be used to achi...
CORR
2010
Springer
14 years 8 months ago
2010
Springer
The Dichotomy Conjecture for Constraint Satisfaction Problems has been verified for conservative problems (or, equivalently, for list homomorphism problems) by Andrei Bulatov. An ...
ICCV
2009
IEEE
16 years 2 months ago
2009
IEEE
The filter flow problem is to compute a space-variant
linear filter that transforms one image into another. This
framework encompasses a broad range of transformations
including...
ICIP
2006
IEEE
15 years 11 months ago
2006
IEEE
We apply the dead-end elimination (DEE) strategy from protein design as a heuristic for the max-flow/min-cut formulation of the image segmentation problem. DEE combines aspects of...
110
click to vote
EMNLP
2006
14 years 11 months ago
2006
Integer Linear Programming has recently been used for decoding in a number of probabilistic models in order to enforce global constraints. However, in certain applications, such a...