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 106 for “"constraint satisfaction problem"”.
-
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 …
-
Commutative, idempotent groupoids and the constraint satisfaction problem
… weak near-unanimity term, then the corresponding constraint satisfaction problem is tractable. A binary operation is weak near-unanimity if and only if it is both commutative and idempotent. Thus if the dichotomy conjecture is true, any finite commutative, idempotent groupoid (CI-groupoid) will be …
-
APPLICATION OF FUZZY LOGIC TO PARTIAL CONSTRAINT SATISFACTION PROBLEM
Constraint-directed search techniques are an efficient approc1ch for solving constraint satisfaction problems (CSPs). These techniques usually use constraint propagation to simplify the original problem, and then employ intelligent backtracking to search for a solution, or all possible solutions, …
-
2-Semilattices: Residual Properties and Applications to the Constraint Satisfaction Problem
… of the class of 2-semilattices, and (iii), the constraint satisfaction problem. Tame Congruence Theory, developed in [29], is a structure theory on finite algebras driven by understanding their prime congruence quotients. The theory assigns to each such quotient a type from 1 to 5. We show that …
-
An Adaptive Linearization Method for a Constraint Satisfaction Problem in Semiconductor Device Design Optimization
… the optimized design goal meets all specified constraints. As in other engineering fields, a nonlinear optimizer is often used for design optimization. One major drawback of using a nonlinear optimizer is that it can only partially explore the design space and return a local optimal solution. …
-
Applications of Graph Theory and Logic in Computer Science
… (Z,succ) with one unary predicate U , its CSP (Constraint Satisfaction Problem) may vary in complexity. We find some sufficient conditions for its tractability, prove bounds on its complexity, and then generalize our results to more complicated structures. We also give a Karp-equivalent …
-
Bounded Width Dichotomies in Constraint Satisfaction Problems
… conjecture for finite structures, namely, the Constraint Satisfaction Problem (CSP) of a finite structure is either in P or NP-complete. We are interested in finding classes in which a stronger dichotomy exists; namely, where every structure has either bounded width or a hard CSP. We call this …
-
Secure Virtual Machine Migration in Cloud Data Centers
… cloud calculus. We show how our verification problem can be reduced to a constraint satisfaction problem that once solved allows reasoning about firewall traffic filtering preservation. Similarly, we present our approach to the verification of intrusion detection monitoring preservation as …
-
Tvarkaraščio sudarymo modeliavimas taikant kvantinius algoritmus /
Quantum computers can possibly solve certain problems with given quantum algorithms in exponential speedup compared to classical architecture oriented computers. The main goal of this thesis is to create school timetable scheduling model, using quantum-hybrid D-Wave solver. General timetable …
-
The complexity and expressive power of valued constraints
… examination of the expressive power of valued constraints and related complexity questions. The valued constraint satisfaction problem (VCSP) is a generalisation of the constraint satisfaction problem which allows to describe a variety of combinatorial optimisation problems. Although most …
-
ClinicalTrACE: a self-correcting agent with interpretable uncertainty for clinical question answering
… events that satisfy type, temporal, and content constraints simultaneously, a multi-constraint satisfaction problem that embedding-based systems cannot solve. We introduce ClinicalTrACE, a self-correcting agent that retrieves through explicit structured queries with no fine-tuning and no …
-
A computer-based tutor for engineering design
… mode of learning through the use of problem sets in routine engineering design domains. This thesis discusses the design of a computer-based system that benefits the instructor and the students in a design course by automating the creation of problem sets and their solution. The …
-
Query-aware generation of database instances for testing database applications
… associated with these queries; forms a Constraint Satisfaction Problem (CSP) by considering the interactions among the queries and the integrity constraints given by the schema; and generates, by solving this CSP, an initial database instance which satisfies the property associated with …
-
CSP dichotomy for ω-categorical monadically stable structures
The constraint satisfaction problem (CSP) over a structure A with a finite relational signature, denoted by CSP(A), is the problem of deciding whether a given finite structure B with the same signature as A has a homomorphism to A. Using concepts and techniques from universal algebra, Bulatov and …
-
Scalable Compiler for TERMES Distributed Assembly System
… bricks. We further recast the old compiler as a constraint satisfaction problem and compare their performance on a range of structures. Results show that the new compiler has significant advantages over the old compiler as the size and complexity of the structures increase. We further developed …
-
Kryssverkstaden - Ett intuitivt konstruktionsverktyg för svenska bildkryss
… visar hur datavetenskaplig logik, innefattande Constraint Satisfaction Problem (CSP) för ordvalidering och algoritmer som Breadth-First Search (BFS) för rutnätsvalidering, kan användas för att underlätta det kreativa hantverket med korsordskonstruktion. Genom att applicera etablerade …
-
Higher-Level Consistencies: Where, When, and How Much
Determining whether or not a Constraint Satisfaction Problem (CSP) has a solution is NP-complete. CSPs are solved by inference (i.e., enforcing consistency), conditioning (i.e., doing search), or, more commonly, by interleaving the two mechanisms. The most common consistency property enforced …
-
ΔΙΑΤΑΞΕΙΣ ΔΙΑΓΡΑΦΩΝ, ΠΑΙΧΝΙΔΙΑ ΚΑΙ ΕΛΑΣΣΟΝΑ ΣΕ ΓΡΑΦΗΜΑΤΑ
… VALUES, THEIR RELATION WITH GRAPH SEARCHING PROBLEMS AND THEIR APPLICATION ON THE CONSTRAINT SATISFACTION PROBLEM AND THE ROUTING PROBLEM ON DISTRIBUTED COMPUTING SYSTEMS. THE BASIC RESULTS ARE THE FOLLOWING. 1) SUBLINEAR ALGORITHM FOR ENFORCING PARTIAL ARE CONSISTENCY ON NETWORKS OF …
-
Uma investigação de algoritmos exatos e metaheurísticos aplicados ao nonograma
… is a logical puzzle whose associated decision problem is NP-complete. It has applications in pattern recognition problems and data compression, among others. The puzzle consists in determining an assignment of colors to pixels distributed in a N M matrix that satisfies line and column …
-
Essays on mechanism design, safety, and crime
… essay shows that any standard implementation problem can be formulated as a question about the existence of a graph that solves a graph coloring problem, establishing a connection between implementation theory and graph theory. More generally, an implementation problem can be viewed as a …
Page 1 of 6