160 search results - page 21 / 32 » Satisfiability-Based Algorithms for Boolean Optimization |
STOC
1996
ACM
15 years 2 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
WINE
2009
Springer
15 years 4 months ago
2009
Springer
We study an economic setting in which a principal motivates a team of strategic agents to exert costly effort toward the success of a joint project. The action taken by each agent...
150
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
This paper introduces RankSQL, a system that provides a systematic and principled framework to support efficient evaluations of ranking (top-k) queries in relational database syst...
PODS
2008
ACM
15 years 10 months ago
2008
ACM
We consider a fundamental flow maximization problem that arises during the evaluation of multiple overlapping queries defined on a data stream, in a heterogenous parallel environm...
ISMVL
2006
IEEE
15 years 3 months ago
2006
IEEE
We define the MaxSAT problem for many-valued CNF formulas, called many-valued MaxSAT, and establish its complexity class. We then describe a basic branch and bound algorithm for ...