971 search results - page 106 / 195 » Approximate Satisfiability and Equivalence |
132
click to vote
PRICAI
1998
Springer
15 years 5 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
PODC
1994
ACM
15 years 4 months ago
1994
ACM
In this paper, we investigate the practical performance of lock-free techniques that provide synchronization on shared-memory multiprocessors. Our goal is to provide a technique t...
101
click to vote
CCS
2006
ACM
15 years 4 months ago
2006
ACM
Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search...
105
click to vote
CIE
2006
Springer
15 years 4 months ago
2006
Springer
or representation theory of groups), and even borrows abstract geometrical concepts like Euler characteristic or Grothendieck ring. However, the most stimulating for proof complexi...
118
click to vote
CSCLP
2006
Springer
15 years 4 months ago
2006
Springer
A number of different satisfaction and optimisation combinatorial problems have recently been approached with constraint programming over the domain of finite sets, for increased d...