Sökning: "constraint satisfaction problem"

Visar resultat 11 - 15 av 28 avhandlingar innehållade orden constraint satisfaction problem.

  1. 11. Variational Methods in Combinatorial Optimization and Phylogeny Reconstruction

    Författare :Henrik Jönsson; Beräkningsbiologi och biologisk fysik - Genomgår omorganisation; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; statistical physics; gravitation; relativity; annealing; variational; mean-field; phylogeny; constraint satisfaction; combinatorial optimization; maximum likelihood; Physics; Fysik; Mathematical and general theoretical physics; quantum mechanics; classical mechanics; klassisk mekanik; kvantmekanik; relativitet; statistisk fysik; termodynamik; Fysicumarkivet A:2001:Jönsson; Matematisk och allmän teoretisk fysik; thermodynamics;

    Sammanfattning : Algorithms based on the variational approach, as used in statistical physics, are developed. For constraint satisfaction problems a novel cost function, based on information-theoretic arguments, is introduced, and an algorithm similar to the mean-field annealing algorithm is proposed. LÄS MER

  3. 12. Stochastic Invariance and Aperiodic Control for Uncertain Constrained Systems

    Författare :Yulong Gao; Karl H. Johansson; Alessandro Abate; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; controlled invariant set; stochastic system; constraint; uncertainty; reachable set; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : Uncertainties and constraints are present in most control systems. For example, robot motion planning and building climate regulation can be modeled as uncertain constrained systems. In this thesis, we develop mathematical and computational tools to analyze and synthesize controllers for such systems. LÄS MER

  4. 13. Complexity Dichotomies for CSP-related Problems

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

    Sammanfattning : 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. LÄS MER

  5. 14. Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems

    Författare :Biman Roy; Peter Jonsson; Victor Lagerkvist; Arnaud Durand; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this thesis we study the worst-case complexity ofconstraint satisfaction problems and some of its variants. We use methods from universal algebra: in particular, algebras of total functions and partial functions that are respectively known as clones and strong partial clones. LÄS MER

  7. 15. Complex Task Allocation for Delegation : From Theory to Practice

    Författare :David Landén; Patrick Doherty; Silvia Coradeschi; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Multi-agent systems; task allocation; distributed constraint satisfaction; delegation; UAV; TECHNOLOGY; TEKNIKVETENSKAP;

    Sammanfattning : The problem of determining who should do what given a set of tasks and a set of agents is called the task allocation problem. The problem occurs in many multi-agent system applications where a workload of tasks should be shared by a number of agents. LÄS MER