Search for dissertations about: "complexity constraint"

Showing result 1 - 5 of 85 swedish dissertations containing the words complexity constraint.

2. 1. Robust Control with Complexity Constraint : A Nevanlinna-Pick Interpolation Approach

   Author : Ryozo Nagamune; KTH; []
   Keywords : Robust control; Nevanlinna-Pick interpolation; complexity constraint; continuation method; model matching; H-infinity control; closed-loop shaping; convex optimization; robust regulation; performance limitations;

   Abstract : .... READ MORE

4. 2. On Some Combinatorial Optimization Problems : Algorithms and Complexity

   Author : Hannes Uppman; Peter Jonsson; Christer Bäckström; Ulf Nilsson; Stanislav Živný; Linköpings universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computational complexity; optimization; constraint satisfaction problem;

   Abstract : This thesis is about the computational complexity of several classes of combinatorial optimization problems, all related to the constraint satisfaction problems.A constraint language consists of a domain and a set of relations on the domain. For each such language there is a constraint satisfaction problem (CSP). READ MORE

5. 3. Complexity Dichotomies for CSP-related Problems

   Author : Gustav Nordh; Peter Jonsson; Andrei Krokhin; Linköpings universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; Complexity; Constraint Satisfaction Problem; System of Equations; Nonmonotonic Logic; Circumscription; Abduction; Isomorphism; Computer science; Datavetenskap;

   Abstract : Ladner’s theorem states that if P ≠ NP, then there are problems in NP that are neither in P nor NP-complete. Csp(Γ) is a class of problems containing many well-studied combinatorial problems in NP. READ MORE

6. 4. Techniques for Efficient Constraint Propagation

   Author : Mikael Zayenz Lagerkvist; Seif Haridi; Christian Schulte; Pierre Flener; KTH; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; constraint programming; constraint propagation; optimization; Computer science; Datalogi;

   Abstract : This thesis explores three new techniques for increasing the efficiency of constraint propagation: support for incremental propagation, improved representation of constraints, and abstractions to simplify propagation.  Support for incremental propagation is added to a propagator centered propagation system by adding a new intermediate layer of abstraction, advisors, that capture the essential aspects of a variable centered system. READ MORE

7. 5. Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications

   Author : Ola Angelsmark; Peter Jonsson; Brahim Hnich; Linköpings universitet; []
   Keywords : NATURVETENSKAP; NATURAL SCIENCES; constraint satisfaction; CSP; graph problems; algorithm construction; computational complexity; microstructures; graph colouring; decision problems; optimisation problems; quantum computing; molecular computing; Computer science; Datavetenskap;

   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