Search for dissertations about: "constraint satisfaction problems"
Showing result 1 - 5 of 28 swedish dissertations containing the words constraint satisfaction problems.
-
1. Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications
Abstract : In this thesis, we will discuss the construction of algorithms for solving Constraint Satisfaction Problems (CSPs), and describe two new ways of approaching them. Both approaches are based on the idea that it is sometimes faster to solve a large number of restricted problems than a single, large, problem. READ MORE
-
2. Beating a Random Assignment : Approximating Constraint Satisfaction Problems
Abstract : An instance of a Boolean constraint satisfaction problem, CSP, consists of a set of constraints acting over a set of Boolean variables. The objective is to find an assignment to the variables that satisfies all the constraints. READ MORE
-
3. Relaxation in constraint satisfaction problems
Abstract : .... READ MORE
-
4. Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction
Abstract : Combinatorial optimization include such tasks as finding the quickest route to work, scheduling jobs to specialists, and placing bus stops so as to minimize commuter times. We consider problems where one is given a collection of constraints with the objective of finding an assignment satisfying as many constraints as possible, also known as Constraint Satisfaction Problems (CSPs). READ MORE
-
5. Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction
Abstract : Problem solving is an integral aspect of modern society and includes such tasks as picking the fastest route to work, optimizing a production line, scheduling computer tasks, placing new bus stops, or picking a meal from available ingredients.We study the hardness of solving Constraint Satisfaction Problems (CSPs). READ MORE