5372 search results - page 799 / 1075 » complexity 2007 |
160
click to vote
CP
2007
Springer
16 years 25 days ago
2007
Springer
We present an algorithm for compressing table constraints representing allowed or disallowed tuples. This type of constraint is used for example in configuration problems, where t...
174
click to vote
CP
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical v...
185
click to vote
CPAIOR
2007
Springer
16 years 25 days ago
2007
Springer
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
180
click to vote
CSCLP
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
172
click to vote
CSL
2007
Springer
16 years 25 days ago
2007
Springer
The Prover/Delayer game is a combinatorial game that can be used to prove upper and lower bounds on the size of Tree Resolution proofs, and also perfectly characterizes the space ...