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 13 of 13 for “"Maximum satisfiability"”.

  1. Global Search Methods for Solving Nonlinear Optimization Problems

    … digital filter banks, (c) the satisfiability problem, (d) the maximum satisfiability problem, and (e) the design of multiplierless quadrature-mirror-filter digital filter banks. Our method achieves better solutions than existing methods, or achieves solutions of the same quality …

    uiuc Repository record for Global Search Methods for Solving Nonlinear Optimization Problems (opens in a new tab)

  2. Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT

    … from AI: Constraint Programing (CP), Boolean Satisfiability (SAT), and Maximum Satisfiability (MAX-SAT). We then use solvers to find optimal solutions to this problem. We show which of these solvers is more efficient when finding optimal solutions. For this purpose, we create a test suite of …

    denver Repository record for Optimizing Vehicle Usage Using CSP, SAT and MAX-SAT (opens in a new tab)

  3. Synthesis of reactive controllers for reconfigurable networked systems

    … one treats the specifications as clauses in a maximum satisfiability (Max-SAT) setting. To benchmark the schemes, a scaled interconnected model of the power distribution network and the thermal management network is created in MATLAB Simulink where these two methods are individually …

    texas Repository record for Synthesis of reactive controllers for reconfigurable networked systems (opens in a new tab)

  4. Formal specifications for cyber-physical systems

    … e.g., different time scales, (b) solving for the satisfiability and maximum satisfiability of two popular specification languages, MLTL and LTL to aid specification debugging and optimally design systems that are safe by construction. Chapter 2 introduces MLTLM as a specification language and …

    iastate Repository record for Formal specifications for cyber-physical systems (opens in a new tab)

  5. Probabilistic Techniques For Constraint Satisfaction Problems

    … for certain hard to solve classes of Boolean satisfiability (SAT), model counting (#SAT), and maximum satisfiability (MaxSAT) problems.

    cornell Repository record for Probabilistic Techniques For Constraint Satisfaction Problems (opens in a new tab)

  6. Bayesian Optimization Algorithm: From Single Level to Hierarchy

    … intelligence---Ising spin-glass systems and maximum satisfiability. Experiments show that even without requiring any prior problem-specific knowledge about the structure of the problem at hand or its properties, hierarchical BOA is capable of achieving comparable or better performance than …

    uiuc Repository record for Bayesian Optimization Algorithm: From Single Level to Hierarchy (opens in a new tab)

  7. Certifying Correctness for Combinatorial Algorithms : by Using Pseudo-Boolean Reasoning

    … that the given answer isvalid. In the Boolean satisfiability (SAT) community, this concept iswell established in the form of proof logging, which has become thestandard solution for generating trustworthy outputs. The problem isthat there are still some SAT solving techniques for which …

    lund Repository record for Certifying Correctness for Combinatorial Algorithms : by Using Pseudo-Boolean Reasoning (opens in a new tab) Download PDF for Certifying Correctness for Combinatorial Algorithms : by Using Pseudo-Boolean Reasoning (opens in a new tab)

  8. Optimal Planning with Learned Neural Network Transition Models

    … Linear Programming (BLP) and Weighted Partial Maximum Satisfiability (WP-MaxSAT), respectively. For the MILP model, we investigate different preprocessing methodologies based on reachability, network sparsification and potential functions to speed up the experimental runtime performance of the …

    toronto-retro Repository record for Optimal Planning with Learned Neural Network Transition Models (opens in a new tab)

  9. Railway Timetable Optimization

    … two heuristic solution algorithms for the Maximum Satisfiability Problem (MaxSAT). In the literature, it has been proposed to encode different NP-complete problems that occur in railway timetabling in MaxSAT. In numerical experiments, we prove that our algorithms are competitive to …

    fu-berlin Repository record for Railway Timetable Optimization (opens in a new tab)

  10. Domain-Based Policies: Policy Mining and Active Learning Frameworks

    … (DTEPM), is NP-complete. We further develop Maximum Satisfiability (MaxSAT) encodings for policy reconstruction. Second, we address scalability and noise. In the clean setting, we recast DBPM as graph coloring and build a GPU accelerated pipeline that achieves substantial speedups over MaxSAT …

    calgary Repository record for Domain-Based Policies: Policy Mining and Active Learning Frameworks (opens in a new tab)

  11. Quantitative Reasoning on Hybrid Formulas with Dynamic Programming

    We perform quantitative reasoning via Stochastic Satisfiability (SSAT), a problem that involves the existential quantifier, the random quantifier, and Boolean formulas. SSAT generalizes the Weighted Satisfiability (WSAT), Weighted Model Counting (WMC), Weighted Projected Model Counting (WPMC), and …

    rice Repository record for Quantitative Reasoning on Hybrid Formulas with Dynamic Programming (opens in a new tab)

  12. Solving MAXSAT by Decoupling Optimization and Satisfaction

    … MAXSAT. MAXSAT is a generalization of the famous Satisfiability (SAT) problem, that associates finite costs with falsifying various desired conditions where these conditions are expressed as propositional clauses. Optimization problems expressed in MAXSAT typically have two interacting components: …

    toronto-retro Repository record for Solving MAXSAT by Decoupling Optimization and Satisfaction (opens in a new tab)

  13. A Study of Spin Glasses and Their Applications

    … of this dissertation is the study of the Boolean satisfiability problem through the use of Ising spin form. The Boolean satisfiability problem is the problem of determining if there exists an assignment of Boolean variables that satisfies a given Boolean formula. Considering that there are rarely …

    tamu Repository record for A Study of Spin Glasses and Their Applications (opens in a new tab)