Sökning: "Approximation theory"

Visar resultat 1 - 5 av 321 avhandlingar innehållade orden Approximation theory.

  1. 1. Pointwise and Genomewide Significance Calculations in Gene Mapping through Nonparametric Linkage Analysis: Theory, Algorithms and Applications

    Detta är en avhandling från Centre for Mathematical Sciences, Lund University

    Författare :Lars Ängquist; [2007]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; programming; actuarial mathematics; Statistik; cytogenetics; Genetik; cytogenetik; Mathematics; Matematik; Statistics; operations research; Genetics; ROC curves; conditioning loci; optimal score functions; noncentrality parameter; cost adjusted relative efficiency; exponential tilting; importance sampling; Monte Carlo simulation; normal approximation; crossover rate; process maximum; analytical approximation; significance calculations; NPL score; conditional linkage analysis; two-locus linkage analysis; Allele sharing; aktuariematematik; operationsanalys; programmering; gene-gene interaction; composite hypotheses; genetic disease models; classes of score functions; nonparametric linkage analysis;

    Sammanfattning : In linkage analysis or, in a wider sense, gene mapping one searches for disease loci along a genome. This is done by observing so called marker genotypes (alleles) and phenotypes (affecteds/unaffecteds) of a pedigree set, i.e. LÄS MER

  2. 2. Label Cover Reductions for Unconditional Approximation Hardness of Constraint Satisfaction

    Detta är en avhandling från Stockholm : Numerical Analysis and Computer Science (NADA), Stockholm University

    Författare :Cenny Wenner; Stockholms universitet.; [2014]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Science; Datalogi; Optimization; NP; Approximation; Approximability; Inapproximability; Constraint Satisfaction; CSP; Boolean Analysis; Satisfiability; SAT; Acyclic Subgraph; Betweenness; Unique Games; datalogi; Computer Science; Combinatorial Optimization; Complexity Theory; Computational Hardness; Kombinatorisk optimering; Komplexitetsteori; Beräkningsteori; Approximerbarhet; Beräkningssvårighet; Optimering; Vilkorssatisfiering; Vilkorsuppfyllning; Vilkorstillfredställand;

    Sammanfattning : Kombinatoriska optimering inkluderar naturliga uppgifter såsom att hitta den snabbaste vägen till sitt arbetet, att schemalägga jobb hos specialister, eller att placera hållplatser för att minimera resenärers restid.Vi begränsar vi oss till de problem i vilket man ges en samling vilkor på variablermed målet att hitta en tilldelning av variablerna uppfyllandes så många som möjligt av vilkoren;så kallade Vilkorsuppfyllningsproblem (eng: Constraint Satisfaction Problems, CSPs). LÄS MER

  3. 3. Numerical analysis for random processes and fields and related design problems

    Detta är en avhandling från Umeå : Institutionen för matematik och matematisk statistik, Umeå universitet

    Författare :Konrad Abramowicz; Umeå universitet.; [2011]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; stochastic processes; random fields; approximation; numerical integration; Hermite splines; piecewise linear interpolator; local stationarity; point singularity; stratified Monte Carlo quadrature; Asian option; Monte Carlo pricing method; Lévy market models; MATHEMATICS Applied mathematics Mathematical statistics; MATEMATIK Tillämpad matematik Matematisk statistik; Mathematical Statistics; matematisk statistik;

    Sammanfattning : In this thesis, we study numerical analysis for random processes and fields. We investigate the behavior of the approximation accuracy for specific linear methods based on a finite number of observations. Furthermore, we propose techniques for optimizing performance of the methods for particular classes of random functions. LÄS MER

  4. 4. Analytical Approximation of Contingent Claims

    Detta är en avhandling från Lund : Department of Economics, Lund Universtiy

    Författare :Karl Larsson; Claus Munk; [2009]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This PhD thesis consists of three separate papers. The common theme is methods to calculate analytical approximations for prices of different contingent claims under various model assumptions. The first two papers deals with approximations of standard European options in stochastic volatility models. LÄS MER

  5. 5. Topics in Hardness of Approximation and Social Choice Theory

    Detta är en avhandling från Göteborg : Chalmers University of Technology

    Författare :Marcus Isaksson; Göteborgs universitet.; Gothenburg University.; [2010]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Hardness of approximation; social choice theory; Gibbard-Satterthwaite; max-q-cut; Condorcet voting; linear threshold functions.;

    Sammanfattning : Tools from Fourier analysis of Boolean functions have commonly been used to prove results both in hardness of approximation in computer science and in the study of voting schemes in social choice theory. In this thesis we consider various topics in both these contexts. LÄS MER