Search for dissertations about: "Approximation algorithm"

Showing result 21 - 25 of 201 swedish dissertations containing the words Approximation algorithm.

  2. 21. Recursive Methods in Urn Models and First-Passage Percolation

    Author : Henrik Renlund; Sven Erick Alm; Svante Janson; John Wierman; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; stochastic approximation algorithm; generalized Polya urn; limit theorem; first-passage percolation; rate of percolation; time constant; Mathematical statistics; Matematisk statistik; Mathematical Statistics; Matematisk statistik;

    Abstract : This PhD thesis consists of a summary and four papers which deal with stochastic approximation algorithms and first-passage percolation. Paper I deals with the a.s. limiting properties of bounded stochastic approximation algorithms in relation to the equilibrium points of the drift function. READ MORE

  4. 22. Geometric Decompositions and Networks - Approximation Bounds and Algorithms

    Author : Joachim Gudmundsson; Institutionen för datavetenskap; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; computer technology; Systems engineering; kontroll; system; Delaunay triangulation; Computational geometry; TSP with neighborhoods; geometric spanners; covering polygons; Computer science; numerical analysis; systems; control; numerisk analys; Datalogi; algebraisk topologi; algebraic topology; Geometry; Data- och systemvetenskap; Geometri;

    Abstract : In this thesis we focus on four problems in computational geometry: In the first four chapters we consider the problem of covering an arbitrary polygon with simpler polygons, i.e., rectangles. READ MORE

  5. 23. Automatic Verification of Parameterized Systems by Over-Approximation

    Author : Vladislavs Jahundovics; Ulf Nilsson; Cristina Seceleanu; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : This thesis presents a completely automatic verification framework to check safety properties of parameterized systems. A parameterized system is a family of finite state systems where every system consists of a finite number of processes running in parallel the same algorithm. READ MORE

  6. 24. Approximation and Calibration of Stochastic Processes in Finance

    Author : Jonas Kiessling; Anders Szepessy; Jonathan Goodman; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; MATHEMATICS; MATEMATIK;

    Abstract : This thesis is a study of approximation and calibration of stochastic processes with applications in finance. It consists of an introduction and four research papers. The introduction is as an overview of the role of mathematics incertain areas of finance. READ MORE

  7. 25. Scalable Machine Learning through Approximation and Distributed Computing

    Author : Theodore Vasiloudis; Anders Holst; Henrik Boström; Seif Haridi; Daniel Gillblad; Indre Žliobaitė; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Online Learning; Distributed Computing; Graph Similarity; Decision Trees; Gradient Boosting;

    Abstract : Machine learning algorithms are now being deployed in practically all areas of our lives. Part of this success can be attributed to the ability to learn complex representations from massive datasets. READ MORE