10871 search results - page 1864 / 2175 » A stable programming language |
165
click to vote
CP
2004
Springer
16 years 4 days ago
2004
Springer
A constraint satisfaction problem (CSP) model can be preprocessed to ensure that any choices made will lead to solutions, without the need to backtrack. This can be especially usef...
148
click to vote
CP
2004
Springer
16 years 4 days ago
2004
Springer
In this paper we study four algorithms for computing the frequency of a given partial order. Here the frequency of a partial order is the number of standard labellings respecting t...
195
click to vote
CP
2004
Springer
16 years 4 days 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...
189
click to vote
CP
2004
Springer
16 years 4 days ago
2004
Springer
We study the quality of LP-based approximation methods for pure combinatorial problems. We found that the quality of the LPrelaxation is a direct function of the underlying constra...
161
click to vote
CP
2004
Springer
16 years 4 days ago
2004
Springer
This paper presents a model and implementation techniques for speeding up constraint propagation. Two fundamental approaches to improving constraint propagation are explored: keepi...