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 23 for “"Constraint satisfaction problems"”.
-
Search in weighted constraint satisfaction problems
A wide variety of real-world optimisation 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 …
-
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
Many problems in artificial intelligence 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 …
-
Valued Constraint Satisfaction Problems over Infinite Domains
… complexity of certain combinatorial 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 …
-
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 …
-
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.
-
Descriptive complexity of constraint problems
Constraint problems are a powerful framework in which many common combinatorial problems can be expressed. Examples include graph colouring problems, Boolean satisfaction, graph cut problems, systems of equations, and many more. One typically distinguishes between constraint satisfaction problems …
-
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 …
-
Learning to Solve Long-Horizon Robot Manipulation Problems
… over time requires the robot to satisfy constraints like collision-freeness, reachability, and action feasibility. For problems with large state spaces, continuous action spaces, and long decision horizons, the hybrid constraint satisfaction problems induced by planners become …
-
Complexity of Basis-Restricted Local Hamiltonians
… theory is to understand which computational problems can be solved with access to certain quantum resources. The subfield of Hamiltonian complexity specifically considers computational problems that ask about properties of local Hamiltonians, which are of critical importance in quantum …
-
Distributed mode estimation through constraint decomposition
… the concept of probabilistic hierarchical constraint automata (PHCA) to compactly model both complex software and hardware behavior. Our method, inspired by this previous work, translates the PHCA model to a constraint representation. This approach handles a more precise initial state …
-
Discrete Transition System Model and Verification for Mitochondrially Mediated Apoptotic Signaling Pathways
… for the discrete model. Through solving Boolean constraint satisfaction problems (SAT-based) and with guided stimulation (Genetic Algorithm), we can further extract the properties and behaviors of the system. Furthermore, our model allows us to conduct cause-effect analysis of the apoptosis …
-
Improved Tools for Local Hamiltonians
In this thesis we consider computational problems related to many-body spin systems with a structured energy operator, a local Hamiltonian. We begin with the most structured setting where the Hamiltonian has a spectral gap and spatial locality. This setting is widely studied using approximate …
-
LP/SDP hierarchy lower bounds for decoding random LDPC codes
… limitations of LP/SDP hierarchies for Maximum Constraint Satisfaction Problems (Max-CSPs). The problem then reduces to the construction of special balanced pairwise independent distributions for Sherali-Adams and special cosets of balanced pairwise independent subgroups for Lasserre. Our …
-
Constraint Solving and Optimizationn Using Nature-Inspired Techniques
Constraint solving and optimization is tackled by scientists in almost every area, including scheduling and planning, configuration, resource allocation, finance, computational biology and machine learning. Since classical systematic and mathematical methods cannot effectively provide suitable …
-
Combining search strategies for distributed constraint satisfaction.
Many real-life problems such as distributed meeting scheduling, mobile frequency allocation and resource allocation can be solved using multi-agent paradigms. Distributed constraint satisfaction problems (DisCSPs) is a framework for describing such problems in terms of related subproblems, called a …
-
Foundations of fuzzy answer set programming
… that is tailored towards combinatorial search problems. Although ASP has been applied to many problems, such as planning, configuration and verification of software, and database repair, it is less suitable for describing continuous problems. In this thesis we therefore studied fuzzy answer set …
-
Investigating the use of interval algebra to schedule mechanically steered multistatic radars
… time of GRASP, as allows for a richer set of constraints than required to perform multistatic scheduling. The Nimble IA Scheduler is a novel contribution which solves the realistic requirement of handling fast-moving and accelerating targets, and provides a small performance increase for the …
Page 1 of 2