Search for dissertations about: "Peter Jonsson"

Showing result 21 - 25 of 28 swedish dissertations containing the words Peter Jonsson.

  2. 21. On Approximating Asymmetric TSP and Related Problems

    Author : Anna Palbom; Mikael Goldmann; Lars Engebretsen; Peter Jonsson; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Komplexity theory; algorithms; approxiamtion; Computer science; Datalogi;

    Abstract : In this thesis we study problems related to approximation of asymmetric TSP. First we give worst case examples for the famous algorithm due to Frieze, Gabiati and Maffioli for asymmetric TSP with triangle inequality. Some steps in the algorithm consist of arbitrary choices. To prove lower bounds, these choices need to be specified. READ MORE

  4. 22. Impedance Matching of Terminal Antennas for Energy Efficient Radio Performance

    Author : Prasadh Ramachandran; Peter Händel; Fredrik Jonsson; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Abstract : .... READ MORE

  5. 23. Numerical simulation of shape rolling

    Author : Stanislav Riljak; Stefan Jonsson; Peter Gudmundson; KTH; []
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; shape rolling; wire-rod rolling; finite-element method; generalized plane-strain; dislocation density; material model; Other materials science; Övrig teknisk materialvetenskap;

    Abstract : In the first part of this thesis, the FE program MSC.Marc is applied for coupled thermomechanical simulations of wire-rod rolling. In order to predict material behaviour of an AISI 302 stainless steel at high strain rates generated during wire-rod rolling, a material model based on dislocation density is applied. READ MORE

  6. 24. Applications of Partial Polymorphisms in (Fine-Grained) Complexity of Constraint Satisfaction Problems

    Author : Biman Roy; Peter Jonsson; Victor Lagerkvist; Arnaud Durand; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

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

  7. 25. Methods for Detecting Unsolvable Planning Instances using Variable Projection

    Author : Simon Ståhlberg; Peter Jonsson; Christer Bäckström; Malte Helmert; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : In this thesis we study automated planning, a branch of artificialintelligence, which deals with construction of plans. A plan is typically an action sequence that achieves some specific goal. In particular, we study unsolvable planning instances, i.e. READ MORE