43 search results - page 6 / 9 » Phase Transitions of Bounded Satisfiability Problems |
ICFEM
2009
Springer
14 years 4 months ago
2009
Springer
Abstract. We study the problem of applying statistical methods for approximate model checking of probabilistic systems against properties encoded as PCTL formulas. Such approximate...
COMBINATORICA
2007
13 years 9 months ago
2007
The standard Erd˝os-Renyi model of random graphs begins with n isolated vertices, and at each round a random edge is added. Parametrizing n 2 rounds as one time unit, a phase tra...
IPL
2006
13 years 9 months ago
2006
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
SARA
2009
Springer
14 years 4 months ago
2009
Springer
We study novel approaches for solving of hard combinatorial problems by translation to Boolean Satisfiability (SAT). Our focus is on combinatorial problems that can be represented...
CORR
2010
Springer
13 years 9 months ago
2010
Springer
The transition from single-core to multi-core processors has made multi-threaded software an important subject in computer aided verification. Here, we describe and evaluate an ex...