971 search results - page 32 / 195 » Approximate Satisfiability and Equivalence |
IPCO
1993
13 years 11 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...
APAL
2006
13 years 10 months ago
2006
We give a short proof of a lemma which generalizes both the main lemma from the original construction in the author's thesis of a model with no 2-Aronszajn trees, and also th...
CCE
2010
13 years 7 months ago
2010
In this work we address the problem of solving multiscenario optimization models that are deterministic equivalents of two-stage stochastic programs. We present a heuristic approx...
CSFW
2012
IEEE
12 years 9 days ago
2012
IEEE
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
SAT
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to ...