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 107 for “"Constraint Satisfaction"”.
-
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 …
-
Hybrid algorithms for distributed constraint satisfaction.
A Distributed Constraint Satisfaction Problem (DisCSP) is a CSP which is divided into several inter-related complex local problems, each assigned to a different agent. Thus, each agent has knowledge of the variables and corresponding domains of its local problem together with the constraints …
-
Acquiring minimalist grammars via constraint satisfaction
… a mathematical structure, a Collection of Constraints, that captures the logical constraints, including those that arise as a consequence of the shortest move constraint, imposed upon the syntactic features of lexical items as they are merged together in a derivation produced by a given …
-
Systematic conformational search with constraint satisfaction
… that satisfy a set of local geometric constraints. Constraints would typically come from NMR experiments, but applications such as docking or homology modelling could also give rise to similar constraints. The molecule to be searched is partitioned into small subchains so that the set …
-
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 …
-
Phase transition behaviour in constraint satisfaction problems
… and computer science can be formulated as constraint satisfaction problems (CSPs). A CSP consists of a set of variables among which a set of constraints are imposed, with a solution corresponding to an assignment for every variable such that no constraints are violated. Most forms of CSP …
-
Constraint satisfaction approaches to bus driver scheduling
… This thesis presents two new ways of using constraint satisfaction to form driver schedules. The two methods differ in their approach, one being a systematic constraint programming approach and the other being an adaptation of a local search method called GENET. The constraint programming …
-
Extending the relational model with constraint satisfaction
We propose a new approach to data driven constraint programming. By extending the relational model to handle constraints and variables as first class citizens, we are able to express first order logic SAT problems using an extended SQL which we refer to as SAT/SQL. With SAT/SQL, one can efficiently …
-
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 …
-
Combining search strategies for distributed constraint satisfaction.
… solved using multi-agent paradigms. Distributed constraint satisfaction problems (DisCSPs) is a framework for describing such problems in terms of related subproblems, called a complex local problem (CLP), which are dispersed over a number of locations, each with its own constraints on the values …
-
Valued Constraint Satisfaction Problems over Infinite Domains
… optimisation problems called \emph{valued constraint satisfaction problems}, or \emph{VCSPs} for short. The requirements and optimisation criteria of these problems are expressed by sums of \emph{(valued) constraints} (also called \emph{cost functions}). More precisely, the input of a VCSP …
-
Programming using a constraint satisfaction system for robotics
… robot. The programming language is based on a constraint system. We describe our implementation of the constraint system, as well as our research done into developing a language based on this system.
-
Robust solutions for constraint satisfaction and optimisation under uncertainty.
… a framework for finding robust solutions of constraint programs. Our approach is based on the notion of fault tolerance. We formalise this concept within constraint programming, extend it in several dimensions and introduce some algorithms to find robust solutions efficiently. When applying …
-
Towards more efficient solution of conditional constraint satisfaction problems
… focus of the thesis is on improving solving constraint satisfaction problems (CSPs) that change with certain conditions. This special class of problems, which we call conditional CSPs, has proved very useful in modeling important applications, such product configuration and design, and …
-
Virtual camera selection using a semiring constraint satisfaction approach
… in a virtual environment using semiring-based constraint satisfaction techniques (SCSP), a soft constraint approach. The system encodes a designer's preferences, and selects the best camera feed even in over-constrained or under-constrained environments. The system functions in real time for …
-
Constraint satisfaction modules : a methodology for analog circuit design
… describes a methodology for solving convex constraint problems using analog circuits. It demonstrates how this methodology can be used to design circuits that solve function-fitting problems through iterated gradient descent. In particular, it shows how to build a small circuit that can …
-
Constraint satisfaction - an alternate approach to unification in Prolog
… In this thesis, we study the incorporation of a constraints solver into Prolog. The generalization of unification into a constraints satisfaction algorithm allows the incorporation of function evaluation into unification. Constraint satisfaction is used to replace unification thus enhancing the …
-
Modifying landscapes with penalties in iterative improvement for solving distributed constraint satisfaction problems.
… may be to model the situations as Distributed Constraint Problems (DisCSPs). DisCSPs formally describe distributed problems where each participant in the problem is represented by an agent, and the collection of agents have to collaborate in order to reach a satisfactory agreement (or find a …
-
An approach to solving constraint satisfaction problems using asynchronous teams of autonomous agents
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 1994.
-
Diagnosing interoperability problems and debugging models by enhancing constraint satisfaction with case -based reasoning
… dissertation proposes a framework that uses the Constraint Satisfaction Problem (CSP) paradigm to define a modeling language and problem solving mechanism for interoperability testing, and uses Case-Based Reasoning (CBR) for debugging interoperability test cases.</p><p>The dissertation makes …
Page 1 of 6