Search for dissertations about: "Data Vetenskap"

Showing result 11 - 15 of 221 swedish dissertations containing the words Data Vetenskap.

  2. 11. From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry

    Author : Mikael Hammar; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; system; numerisk analys; Datalogi; systems; control; numerical analysis; Approximation Algorithms; Computational Geometry; Online Algorithms; Art Gallery Problem; Linear Search; Traveling Salesman Problem; R-Tree; Delaunay Triangulation; Polygon Exploration; Computer science; Shortest Watchman Routes; kontroll; Mathematics; Matematik;

    Abstract : We give approximation and online algorithms as well as data structures for some well studied problems in computational geometry. The thesis is divided into three parts. In part one, we study problems related to guarding, exploring and searching geometric environments. READ MORE

  4. 12. Fixed parameter algorithms and other results for convex patitions

    Author : Magdalene Grantson Borgelt; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : It is known that the minimum edge length convex partition MWCP of polygons with holes (an example of a PSLG) is NP-hard. Partitioning polygons with holes into the minimum number of convex polygons MNCP is also known to be NP-hard. READ MORE

  5. 13. Fixed-Parameter Algorithms for Optimal Convex Partitions and Other Results

    Author : Magdalene Grantson Borgelt; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; control; Datalogi; numerical analysis; Convex Partition; Computer science; Triangulation; kontroll; system; numerisk analys; systems; Fixed-Parameter Algorithm; Spanning Tree;

    Abstract : In this thesis I study two-dimensional geometric optimization problems for which it is difficult to find efficient, exact, deterministic algorithms. All known solutions to these problems require time that is exponential in the total size of the input. READ MORE

  6. 14. Exact and approximation algorithms for graph problems with some biological applications

    Author : Eva-Marta Lundell; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Graph algorithms; computational biology; approximation algorithms; computational complexity; evolutionary trees; maximum agreement subtree; graph embedding; shortest cycle; clique partitioning;

    Abstract : In this thesis we study several combinatorial problems in algorithmic graph theory and computational biology, and different algorithmical approaches for solving them. In particular, we focus on graph algorithms, seeking for the most part polynomial or sub-exponential exact solutions, but in some cases also approximate solutions. READ MORE

  7. 15. Conditional Partial Plans for Rational Situated Agents Capable of Deductive Reasoning and Inductive Learning

    Author : Slawomir Nowaczyk; Data Vetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Computer Science; Rational Agents; Artificial Intelligence; Machine Learning;

    Abstract : Rational, autonomous agents that are able to achieve their goals in dynamic, partially observable environments are the ultimate dream of Artificial Intelligence research since its beginning. The goal of this PhD thesis is to propose, develop and evaluate a framework well suited for creating intelligent agents that would be able to learn from experience, thus becoming more efficient at solving their tasks. READ MORE