Sökning: "polynomial constraints"

Visar resultat 6 - 10 av 37 avhandlingar innehållade orden polynomial constraints.

  1. 6. Numerical Methods for Geometric Vision: From Minimal to Large Scale Problems

    Författare :Martin Byröd; Matematik LTH; []
    Nyckelord :Minimal Problems; Bundle Adjustment; Computer Vision; Polynomial Equations;

    Sammanfattning : This thesis presents a number of results and algorithms for the numerical solution of problems in geometric computer vision. In geometric computer vision one tries to extract geometric information about the world and the observer from a sequence of images. LÄS MER

  3. 7. Optimization Models and Methods for Telecommunication Networks using OSPF

    Författare :Peter Broström; Michal Pióro; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Telecommunication; OSPF; LP-duality; Polynomial methods; MATHEMATICS; MATEMATIK;

    Sammanfattning : The routing in OSPF Telecommunication networks is determined by computing shortest paths with respect to link weights set by the network operator. All shortest paths to a destination are used by the routers when traffic is routed, and the routers split the traffic evenly when alternative shortest paths exist. LÄS MER

  4. 8. Construction of Adaptive Multistep Methods for Problems with Discontinuities, Invariants, and Constraints

    Författare :Fatemeh Mohammadi; Numerisk analys; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; multistep methods; Initialization; beta-blocking; Discontinuity; Time adaptivity; Strong stability preserving; Differential algebraic equations;

    Sammanfattning : Adaptive multistep methods have been widely used to solve initial value problems. These ordinary differential equations (ODEs) may arise from semi-discretization of time-dependent partial differential equations(PDEs) or may combine with some algebraic equations to represent a differential algebraic equations (DAEs). LÄS MER

  5. 9. On specification and inference in the econometrics of public procurement

    Författare :David Sundström; Kurt Brännäs; Sofia Lundberg; Michael Visser; Umeå universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; auctions; dependent variable transformation model; green public procurement; indirect inference; instrumental variable; latent variable; log-generalized gamma distribution; maximum likelihood; measurement error; non-linear least squares; objective effectiveness; orthogonal polynomial regression; prediction; simulation estimation; structural estimation; nationalekonomi; Economics; Econometrics; ekonometri;

    Sammanfattning : In Paper [I] we use data on Swedish public procurement auctions for internal regularcleaning service contracts to provide novel empirical evidence regarding green publicprocurement (GPP) and its effect on the potential suppliers’ decision to submit a bid andtheir probability of being qualified for supplier selection. We find only a weak effect onsupplier behavior which suggests that GPP does not live up to its political expectations. LÄS MER

  7. 10. On Infinite-Domain CSPs Parameterized by Solution Cost

    Författare :George Osipov; Peter Jonsson; Victor Lagerkvist; Robert Ganian; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this thesis we study the computational complexity of MinCSP - an optimization version of the Constraint Satisfaction Problem (CSP). The input to a MinCSP is a set of variables and constraints applied to these variables, and the goal is to assign values (from a fixed domain) to the variables while minimizing the solution cost, i.e. LÄS MER