Search for dissertations about: "Constraint"

Showing result 21 - 25 of 570 swedish dissertations containing the word Constraint.

  2. 21. On the Performance of Underlay Cognitive Radio Networks with Interference Constraints and Relaying

    Author : Charles Kabiri; Blekinge Tekniska Högskola; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Cognitive Radio Networks; Cognitive Cooperative Relay Networks; Underlay Spectrum Access; Interference Constraint; Outage Constraint;

    Abstract : Efficiently allocating the scarce and expensive radio resources is a key challenge for advanced radio communication systems. To this end, cognitive radio (CR) has emerged as a promising solution which can offer considerable improvements in spectrum utilization. READ MORE

  4. 22. Constraint-Driven Design Space Exploration for Memory-Dominated Embedded Systems

    Author : Radoslaw Szymanek; Institutionen för datavetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; systems; control; Datalogi; numerisk analys; system; kontroll; Computer science; memory; design space exploration; embedded systems; constraint programming; numerical analysis;

    Abstract : Today, embedded systems often consist of many different processing, communication, and memory units. This makes an embedded system a multiprocessor system. There are usually many possible multiprocessor architectures and therefore we need tool support for fast evaluation of numerous design alternatives. READ MORE

  5. 23. Stochastic Invariance and Aperiodic Control for Uncertain Constrained Systems

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

    Abstract : 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. READ MORE

  6. 24. Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction

    Author : Cenny Wenner; Johan Håstad; Irit Dinur; Numerical Analysis and Computer Science (NADA) Faculty of Science Stockholm University; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Optimization; NP; Approximation; Approximability; Inapproximability; Constraint Satisfaction; CSP; Boolean Analysis; Satisfiability; SAT; Acyclic Subgraph; Betweenness; Unique Games; Computer Science; Datalogi;

    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

  7. 25. Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction

    Author : Cenny Wenner; Johan Håstad; Viggo Kann; Irit Dinur; Stockholms universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Combinatorial Optimization; Complexity Theory; Approximation; Approximability; Inapproximability; Computational Hardness; NP; Optimization; Constraint Satisfaction; Kombinatorisk optimering; Komplexitetsteori; Beräkningsteori; Approximation; Approximerbarhet; Beräkningssvårighet; NP; Optimering; Vilkorssatisfiering; Vilkorsuppfyllning; Vilkorstillfredställand; datalogi; Computer Science;

    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