942 search results - page 132 / 189 » Distance Constraint Satisfaction Problems |
124
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
We consider the problem of embedding arbitrary objects (e.g., images, audio, documents) into Euclidean space subject to a partial order over pairwise distances. Partial order cons...
129
Voted
CP
2005
Springer
15 years 9 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...
118
click to vote
CP
2006
Springer
15 years 7 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
136
Voted
ANOR
2004
15 years 3 months ago
2004
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
189
Voted
CPAIOR
2010
Springer
15 years 1 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...