881 search results - page 72 / 177 » Solving satisfiability problems with preferences |
Book
"Constraint satisfaction is a general problem in which the goal is to find values for a set of variables that will satisfy a given set of constraints. It is the core of many a...
ASPDAC
2006
ACM
14 years 2 months ago
2006
ACM
We propose a methodology for optimal k-way partitioning with replication of directed hypergraphs via Boolean satisfiability. We begin by leveraging the power of existing and emerg...
CC
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
AAAI
1994
13 years 10 months ago
1994
It has recently been shown that local search is surprisingly good at nding satisfying assignments for certain computationally hard classes of CNF formulas. The performance of basi...
AAAI
1990
13 years 10 months ago
1990
Recently-developed techniques have improved the performance of production systems several times over. However, these techniques are not yet adequate for continuous problem solving...