430 search results - page 63 / 86 » On Using Satisfiability-Based Pruning Techniques in Covering... |
172
click to vote
VLDB
2008
ACM
15 years 10 months ago
2008
ACM
Mapping composition is a fundamental operation in metadata driven applications. Given a mapping over schemas 1 and 2 and a mapping over schemas 2 and 3, the composition problem is...
CSCLP
2003
Springer
15 years 3 months ago
2003
Springer
This paper considers the issue of postprocessing the output of interval-based solvers for further exploitations when solving numerical CSPs with continuum of solutions. Most interv...
64
Voted
CONSTRAINTS
2007
14 years 10 months ago
2007
SAT is probably one of the most-studied constraint satisfaction problems. In this paper, a new hybrid technique based on local search is introduced in order to approximate and ext...
CASES
2006
ACM
15 years 4 months ago
2006
ACM
Computer architects are constantly faced with the need to improve performance and increase the efficiency of computation in their designs. To this end, it is increasingly common ...
SIGCOMM
2006
ACM
15 years 4 months ago
2006
ACM
To enhance web browsing experiences, content distribution networks (CDNs) move web content “closer” to clients by caching copies of web objects on thousands of servers worldwi...