Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 5 of 5 for “"MAX-SAT"”.
-
Structure in combinatorial optimization and its effect on heuristic performance
… or greater rate with the instance size. The maximum boolean satisfiability (MAX-SAT) is one such problem that has many important theoretical and practical applications. Due to the exponential growth of the search space, sufficiently large instances of MAX-SAT are intractable for complete …
-
Exploring Constraint Satisfiability Techniques in Formal Verification
… widespread demands for efficient Propositional Satisfiability (SAT) solvers and its derivatives in Electronic Design Automation applications, methods to boost the performance of the SAT solver are highly desired. This dissertation aims to enhance the performance of SAT and related SAT solving …
-
Ground state determination, ground state preserving fit for cluster expansion and their integration for robust CE construction
… and NP-hard combinatorial optimization (MAX-SAT). We have proposed a general scheme, upper bound and lower bound calculation to approach this problem. Firstly, based on the traditional configurational polytope method, we have proposed a method called cluster tree optimization method, …
-
Investigating Topological Quantum Matter: Machine Learning Topological Phases, Topological Quantum Codes, Interplay of Disorder and Topology via Transport Phenomena and Phase Transitions
… near-term algorithms that coax useful optimisation and learning behaviour from noisy, intermediate-scale quantum processors. This dissertation attacks all three challenges through a single computational lens that marries variational wave-function design, clause-density-optimal Max-SAT …
-
Constraint Solving for Diagnosing Concurrency Bugs
… problems. By leveraging the power of constraint satisfiability (SAT) solvers and a bounded model checker, we perform a semantic analysis of the sequential computation as well as the thread interactions. The analysis is ideally suited for handling software with small to medium code size but …