4117 search results - page 476 / 824 » On the Satisfiability of Complex Constraints |
193
click to vote
CPAIOR
2007
Springer
16 years 1 months 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...
188
click to vote
CSCLP
2007
Springer
16 years 1 months 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...
170
click to vote
OTM
2007
Springer
16 years 1 months ago
2007
Springer
Abstract: This paper proposes extensions to the Object-Role Modeling approach to support schema transformations that eliminate unneeded columns that may arise from standard relatio...
169
click to vote
ASPDAC
2004
ACM
16 years 9 days ago
2004
ACM
Improving logic capacity by time-sharing, dynamically reconfigurable FPGAs are employed to handle designs of high complexity and functionality. In this paper, we use a novel topo...
181
click to vote
ICFEM
2004
Springer
16 years 8 days ago
2004
Springer
Abstract. We present a “memory-model-sensitive” approach to validating correctness properties for multithreaded programs. Our key insight is that by specifying both the inter-t...