159 search results - page 15 / 32 » On the Complexity of SAT |
ATAL
2003
Springer
15 years 2 months ago
2003
Springer
In this paper, we examine two multi-agent based representations of SATs and further experimentally study the topologies of resulting agent networks. We show that different repres...
WCET
2003
14 years 11 months ago
2003
Calculating the WCET of mission-critical satellite applications is a challenging issue. The European Space Agency is currently undertaking the CryoSat mission, consisting of a rad...
120
click to vote
VLSID
2010
IEEE
14 years 7 months ago
2010
IEEE
Directed test generation is important for the functional verification of complex system-on-chip designs. SAT based bounded model checking is promising for counterexample generatio...
96
Voted
SAT
2010
Springer
14 years 8 months ago
2010
Springer
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
CP
2007
Springer
15 years 3 months ago
2007
Springer
Abstract There has been considerable interest in the identification of structural properties of combinatorial problems that lead to efficient algorithms for solving them. Some of...