1795 search results - page 180 / 359 » On the Complexity of Circuit Satisfiability |
AAMAS
2010
Springer
13 years 10 months ago
2010
Springer
This paper investigates cooperative search strategies for agents engaged in costly search in a complex environment. Searching cooperatively, several search goals can be satisfied w...
ADT
2010
13 years 10 months ago
2010
: In the era of mobile and wireless networks, the growing complexity of end devices and the accentuated tendency towards miniaturization of them raise new security challenges. Auth...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Many problems in mathematics and computer science can be reduced to proving the satisfiability of conjunctions of literals in a background theory which is often the extension of a ...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We study here fundamental issues involved in top-k query evaluation in probabilistic databases. We consider simple probabilistic databases in which probabilities are asso...
SIAMCOMP
2002
13 years 9 months ago
2002
We consider several problems related to the use of resolution-based methods for determining whether a given boolean formula in conjunctive normal form is satisfiable. First, build...