Sökning: "Peter Jonsson"

Visar resultat 11 - 15 av 33 avhandlingar innehållade orden Peter Jonsson.

1. 11. A Study in the Computational Complexity of Temporal Reasoning

   Författare :Mathias Broxvall; Peter Jonsson; Ulf Nilsson; Anders Haraldsson; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; temporal and spatial information; artificiell intelligens; algebra; tractable fragments; temporal formalisms; formalism STP; Computer science; Datavetenskap;

   Sammanfattning : Reasoning about temporal and spatial information is a common task in computer science, especially in the field of artificial intelligence. The topic of this thesis is the study of such reasoning from a computational perspective. LÄS MER

3. 12. Computational Complexity of some Optimization Problems in Planning

   Författare :Meysam Aghighi; Peter Jonsson; Christer Bäckström; Hector Geffner; Linköpings universitet; []
   Nyckelord :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

4. 13. Laborativt arbete i fysikundervisningen : Något som behöver diskuteras!

   Författare :Jan Andersson; Margareta Enghag; Gunnar Jonsson; Kjell Magnusson; Peter Gustafsson; Karlstads universitet; []
   Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Laborativt arbete; Fysikdidaktik; Kommunikation; Effektivitet; Laborationsformer; Physics; Fysik;

   Sammanfattning : BaksidestextI gymnasieskolans kursplaner för ämnet fysik framhålls det undersökande arbetssättet genom att betona att eleverna ska ges förutsättningar att utveckla förmågan att söka svar på frågor, planera, genomföra, tolka och redovisa experiment. Eleverna ska dessutom ges möjligheter att använda sina kunskaper i fysik för att kommunicera, argumentera och presentera slutsatser. LÄS MER

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

   Författare :Ola Angelsmark; Peter Jonsson; Brahim Hnich; Linköpings universitet; []
   Nyckelord :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;

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

7. 15. Exact Algorithms for Exact Satisfiability Problems

   Författare :Vilhelm Dahllöf; Peter Jonsson; Fedor Fomin; Linköpings universitet; []
   Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NP-hardness; exact algorithms; satisfiability; exact satisfiability; Computer science; Datalogi;

   Sammanfattning : This thesis presents exact means to solve a family of NP-hard problems. Starting with the well-studied Exact Satisfiability problem (XSAT) parents, siblings and daughters are derived and studied, each with interesting practical and theoretical properties. LÄS MER