8009 search results - page 152 / 1602 » cans 2005 |
128
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Subquadrangles are a natural way in which to represent constraints as they do not restrict any subset of their scope. There are already known methods for converting any g...
108
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Many combinatorial problems require of their solutions that they achieve a certain balance of given features. In the constraint programming literature, little has been written to s...
131
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
We present a method for propagating linear constraints. Our technique exploits the fact that the interior point method converges on a central point of the polytope. A variable assi...
142
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
When the search for a solution to a constraint satisfaction problem backtracks, it is not usually worthwhile to remember the assignment that failed, because the same assignment wil...
118
click to vote
CSL
2005
Springer
15 years 10 months ago
2005
Springer
Implementations of real number computations have largely been unusable in practice because of their very bad performance, especially in comparison to floating point arithmetic imp...