Search for dissertations about: "Approximable"

Showing result 1 - 5 of 6 swedish dissertations containing the word Approximable.

  2. 1. On numbers badly approximable by q-adic rationals

    Author : Johan Nilsson; Matematik LTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Number theory; Symbolic dynamics; Combinatorics on words; Badly approximable numbers; Diophantine approximation; Mathematics; Matematik; Dynamical systems;

    Abstract : The thesis takes as starting point diophantine approximation with focus on the area of badly approximable numbers. For the special kind of rationals, the q-adic rationals, we consider two types of approimations models, a one-sided and a two-sided model, and the sets of badly approximable numbers they give rise to. READ MORE

  4. 2. Boundary Behavior of p-Laplace Type Equations

    Author : Benny Avelin; Kaj Nyström; Steve Hofmann; Uppsala universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; p-Laplace; Boundary Harnack inequality; A-harmonic; Ahlfors regularity; NTA-domains; Martin boundary; Reifenberg flat; Approximable by Lipschitz graphs; Subelliptic; Carleson estimate; Mathematics; Matematik;

    Abstract : This thesis consists of six scientific papers, an introduction and a summary. All six papers concern the boundary behavior of non-negative solutions to partial differential equations.Paper I concerns solutions to certain p-Laplace type operators with variable coefficients. READ MORE

  5. 3. Optimization of Joint Cell, Channel and Power Allocation in Wireless Communication Networks

    Author : Mikael Fallgren; Anders Forsgren; Zhi-Quan (Tom) Luo; KTH; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Wireless multicell networks; Optimization; OFDMA; Shannon capacity; Complexity; NP-hard; Relays; Allocation problems; Heuristic algorithms;

    Abstract : In this thesis we formulate joint cell, channel and power allocation problems within wireless communication networks. The objectives are to maximize the user with mini- mum data throughput (Shannon capacity) or to maximize the total system throughput, referred to as the max-min and max-sum problem respectively. READ MORE

  6. 4. Aspects of a Constraint Optimisation Problem

    Author : Johan Thapper; Peter Jonsson; David Cohen; Linköpings universitet; []
    Keywords : TECHNOLOGY; TEKNIKVETENSKAP;

    Abstract : In this thesis we study a constraint optimisation problem called the maximum solution problem, henceforth referred to as Max Sol. It is defined as the problem of optimising a linear objective function over a constraint satisfaction problem (Csp) instance on a finite domain. READ MORE

  7. 5. Exploiting Structure in CSP-related Problems

    Author : Tommy Färnqvist; Peter Jonsson; Miki Hermann; Linköpings universitet; []
    Keywords : NATURVETENSKAP; NATURAL SCIENCES;

    Abstract : In this thesis we investigate the computational complexity and approximability of computational problems from the constraint satisfaction framework. An instance of a constraint satisfaction problem (CSP) has three components; a set V of variables, a set D of domain values, and a set of constraints C. READ MORE