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 20 of 364 for “"Constraint satisfaction"”.

  1. Promise constraint satisfaction problems

    … the complexity of various approximations of constraint satisfaction problems. In the constraint satisfaction problem (CSP), we are given a set of variables, a domain for the variables, and a set of constraints on those variables, and must construct an assignment of values from the domain to …

    oxford Repository record for Promise constraint satisfaction problems (opens in a new tab)

  2. Promise constraint satisfaction problems

    <p>The promise constraint satisfaction problem (PCSP) is a recently introduced vast generalisation of the constraint satisfaction problem (CSP) that captures approximability of satisfiable instances. A PCSP instance comes with two forms of each constraint: a strict one and a weak one. Given the …

    oxford Repository record for Promise constraint satisfaction problems (opens in a new tab)

  3. Metareasoning about propagators for constraint satisfaction

    Given the breadth of constraint satisfaction problems (CSPs) and the wide variety of CSP solvers, it is often very difficult to determine a priori which solving method is best suited to a problem. This work explores the use of machine learning to predict which solving method will be most effective …

    sask Repository record for Metareasoning about propagators for constraint satisfaction (opens in a new tab)

  4. Integrating Probabilistic Reasoning with Constraint Satisfaction

    … probabilistic reasoning is closely related to constraint satisfaction at a formal level, and that this relationship yields effective algorithms for guiding constraint satisfaction and constraint optimization solvers. By taking a unified view of probabilistic inference and constraint reasoning …

    toronto-retro Repository record for Integrating Probabilistic Reasoning with Constraint Satisfaction (opens in a new tab)

  5. On dual encodings for constraint satisfaction.

    regina Repository record for On dual encodings for constraint satisfaction. (opens in a new tab)

  6. On the valued constraint satisfaction problem

    <p>The Valued Constraint Satisfaction Problem (VCSP) is a framework which captures many natural decision and optimisation problems. An instance of the VCSP consists of a set of variables, which are to be assigned labels from a finite domain, and a collection of local constraints, each specified by …

    oxford Repository record for On the valued constraint satisfaction problem (opens in a new tab)

  7. Transformations of representation in constraint satisfaction

    <p>In this thesis I study constraint satisfaction problems or CSPs. These require determining whether values can be assigned to variables so that all constraints are satisfied. An important challenge is to identify tractable CSPs which can be solved efficiently.</p> <p>CSP instances have usually …

    oxford Repository record for Transformations of representation in constraint satisfaction (opens in a new tab)

  8. Constraint Satisfaction Techniques for Combinatorial Problems

    … advances in tools and techniques for constraint satisfaction. These advances have in turn created great interest in their industrial applications. As a result, tools and techniques are often tailored to meet the needs of industrial applications out of the box. We claim that in the case …

    rit Repository record for Constraint Satisfaction Techniques for Combinatorial Problems (opens in a new tab)

  9. Probabilistic Techniques For Constraint Satisfaction Problems

    Constraint satisfaction problems (CSPs) are at the core of many tasks with direct practical relevance, such as hardware and software verification, planning, and scheduling to name a few. The two main solution paradigms for solving such problems are based on backtrack-style search and local search. …

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

  10. Search in weighted constraint satisfaction problems

    … problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs). Such problems are NP-hard and require an exponential amount of time to find the optimal solution. This thesis concentrates on the University Examination Timetabling Problem. A general abstraction of this …

    whiterose Download PDF for Search in weighted constraint satisfaction problems (opens in a new tab)

  11. Heuristically guided constraint satisfaction for AI planning

    … using alternative techniques. One such paradigm, Constraint Programming (CP), has successfully been used in various planner architectures in recent years. The efficacy of a given constraint reformulation depends on the encoding method, search technique(s) employed, and the consequent amount of …

    strathclyde Repository record for Heuristically guided constraint satisfaction for AI planning (opens in a new tab)

  12. Conceptual design using probabilistic interval constraint satisfaction

    … application of interval analysis to numerical constraint satisfaction problems. The result is a method of analysis referred to as Probabilistic Constraint Satisfaction that can be used to analyze problems with probabilistic input and generate a probabilistic design space as an output. The …

    ubc Repository record for Conceptual design using probabilistic interval constraint satisfaction (opens in a new tab) Download PDF for Conceptual design using probabilistic interval constraint satisfaction (opens in a new tab)

  13. Interactive exploration of numerical constraint satisfaction problems

    … methods like interval arithmetic and interval constraints automatically compute an estimate of the error for each real number. These methods have proved to be valuable in numerical computation because of their certainty in the results. But problems with conventional numerical analysis …

    uvic Repository record for Interactive exploration of numerical constraint satisfaction problems (opens in a new tab)

  14. Threshold Phenomena in Random Constraint Satisfaction Problems

    … k >= 3, is just one family of a large number of constraint satisfaction problems that are conjectured to have exact satisfiability thresholds, but for which the existence and location of these thresholds has yet to be proven. Of those problems for which we are able to prove an exact …

    toronto-retro Repository record for Threshold Phenomena in Random Constraint Satisfaction Problems (opens in a new tab)

  15. Resolution Complexity of Random Constraint Satisfaction Problems

    The resolution complexity of random constraint satisfaction problems is a widely studied topic. This line of research started with a seminal paper by Chvátal and Szemeréd. They showed that for any ≥ 3, w.h.p. an unsatisfiable random -SAT instance has exponentially high resolution complexity when …

    toronto-retro Repository record for Resolution Complexity of Random Constraint Satisfaction Problems (opens in a new tab)

Page 1 of 19