Sökning: "discrete time"

Visar resultat 11 - 15 av 577 avhandlingar innehållade orden discrete time.

  1. 11. Digital Geometry, Combinatorics, and Discrete Optimization

    Författare :Shiva Samieinia; Christer Kiselman; Rikard Bøgvad; Rémy Malgouyres; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Digital geometry; Khalimsky topology; Khalimsky plane; Khalimsky-continuous function; digital straight line segments; discrete optimization; discrete convexity; integral convexity; lateral convexity; marginal function; MATHEMATICS; MATEMATIK; Mathematics; matematik;

    Sammanfattning : This thesis consists of two parts: digital geometry and discrete optimization. In the first part we study the structure of digital straight line segments. We also study digital curves from a combinatorial point of view. LÄS MER

  3. 12. High precision motion control based on a discrete-time sliding mode approach

    Författare :Yufeng Li; KTH; []
    Nyckelord :variable structure; sliding mode; discrete-time; high precision motion control; friction; flexibility; robust; electro-mechanical system;

    Sammanfattning : .... LÄS MER

  4. 13. Topics in algorithmic, enumerative and geometric combinatorics

    Författare :Ragnar Freij; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Discrete Morse theory; simplicial G-complex; centrally symmetric polytope; split graph; derangement; pattern packing; composition; finite poset; optimal stopping; secretary problem.; finite poset;

    Sammanfattning : This thesis presents five papers, studying enumerative and extremal problems on combinatorial structures. The first paper studies Forman's discrete Morse theory in the case where a group acts on the underlying complex. LÄS MER

  5. 14. On random satisfiability and optimization problems

    Författare :Joel Larsson; Klas Markström; Roland Häggkvist; Victor Falgas Ravry; Stefanie Gerke; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Random graphs; k-SAT; satisfiability; coupon collector; random cover time; threshold phenomenon; concentration of measure; combinatorial probability; perfect matching; assignment problem; local graph limit; mean-field; Mathematics; matematik;

    Sammanfattning : In Paper I, we study the following optimization problem: in the complete bipartite graph where edges are given i.i.d. weights of pseudo-dimension q>0, find a perfect matching with minimal total weight. LÄS MER

  7. 15. Asymptotic Analysis of Hedging Errors Induced by Discrete Time Hedging

    Författare :Mats Brodén; Matematisk statistik; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Discrete time hedging; discretization error; L2 convergence; Non-linear Kalman filters; Calibration;

    Sammanfattning : The first part of this thesis deals with approximations of stochastic integrals and discrete time hedging of derivative contracts; two closely related subjects. Paper A considers the problem of approximating the value of a Wiener process. LÄS MER