Sökning: "Peter Bäckström"

Visar resultat 1 - 5 av 7 avhandlingar innehållade orden Peter Bäckström.

  1. 1. Essays on military labour supply in the era of voluntary recruitment

    Författare :Peter Bäckström; Gauthier Lanot; Niklas Hanes; Stephanie Vincent Lyk-Jensen; Umeå universitet; []
    Nyckelord :SOCIAL SCIENCES; SAMHÄLLSVETENSKAP; SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; conscription; enlistment test; fixed effects model; military labour market; military labour supply; military recruitment; recruitment; Roy model; self-selection; Economics; nationalekonomi;

    Sammanfattning : This thesis consists of an introductory part and two self-contained chapters related to the supply of volunteers to the Swedish Armed Forces.Chapter [I] represents the first effort to explore the relationship between civilian labour market conditions and the supply of labour to the military in the all-volunteer environment that Sweden entered after the abolishment of the peacetime draft in 2010. LÄS MER

  2. 2. Computational Complexity of some Optimization Problems in Planning

    Författare :Meysam Aghighi; Peter Jonsson; Christer Bäckström; Hector Geffner; Linköpings universitet; []
    Nyckelord :ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : Automated planning is known to be computationally hard in the general case. Propositional planning is PSPACE-complete and first-order planning is undecidable. One method for analyzing the computational complexity of planning is to study restricted subsets of planning instances, with the aim of differentiating instances with varying complexity. LÄS MER

  3. 3. Strong Partial Clones and the Complexity of Constraint Satisfaction Problems : Limitations and Applications

    Författare :Victor Lagerkvist; Peter Jonsson; Christer Bäckström; Nadia Creignou; Linköpings universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this thesis we study the worst-case time complexity of the constraint satisfaction problem parameterized by a constraint language (CSP(S)), which is the problem of determining whether a conjunctive formula over S has a model. To study the complexity of CSP(S) we borrow methods from universal algebra. LÄS MER

  4. 4. Residual stresses, fatigue and deformation in cast iron

    Författare :Mattias Lundberg; Johan Moverare; Ru Lin Peng; Taina Ahmad; Daniel Bäckström; Maqsood Ahmad; Sten Johansson; Mattias Calmunger; Peter Hedström; Linköpings universitet; []
    Nyckelord :ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : The complex geometry of cylinder heads in heavy-duty diesel engines makes grey iron or compact graphite iron a preferred material choice due to its price, castability, thermal conductivity and damping capacity. Today’s strict emission laws have increased the demands on engine performance and engine efficiency. LÄS MER

  5. 5. Methods for Detecting Unsolvable Planning Instances using Variable Projection

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

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