7092 search results - page 367 / 1419 » Parallelizing constraint programs |
112
click to vote
CP
2007
Springer
15 years 9 months ago
2007
Springer
We consider soft constraint problems where some of the preferences may be unspecified. This models, for example, situations with several agents providing the data, or with possibl...
127
click to vote
CP
2007
Springer
15 years 9 months ago
2007
Springer
We propose a new top down search-based algorithm for compiling AND/OR Multi-Valued Decision Diagrams (AOMDDs), as representations of the optimal set of solutions for constraint opt...
132
Voted
CP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. The paper presents a new look-ahead scheme for backtracking search for solving constraint satisfaction problems. This look-ahead scheme computes a heuristic for value ord...
123
click to vote
RECOMB
1997
Springer
15 years 7 months ago
1997
Springer
A progressive alignment algorithm produces a multi-alignment of a set of sequences by repeatedly aligning pairs of sequences and/or previously generated alignments. We describe a ...
126
click to vote
ESA
2006
Springer
15 years 6 months ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...