2109 search results - page 47 / 422 » Solving Necklace Constraint Problems |
135
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
Decomposition is a powerful technique for reducing the size of a backtracking search tree. However, when solving constraint optimization problems (COP's) the standard techniqu...
180
click to vote
MP
2008
15 years 4 months ago
2008
Stochastic dominance relations are well-studied in statistics, decision theory and economics. Recently, there has been significant interest in introducing dominance relations into...
132
click to vote
LPAR
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The paper describes the formalization and implementation of an efficient constraint programming framework operating on 3D crystal lattices. The framework is motivated an...
127
click to vote
AAAI
2004
15 years 5 months ago
2004
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
165
click to vote
CONSTRAINTS
2010
15 years 4 months ago
2010
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...