Search for dissertations about: "Approximation algorithm"

Showing result 1 - 5 of 164 swedish dissertations containing the words Approximation algorithm.

  1. 1. Resource Allocation with Potts Mean Field Neural Network Techniques

    University dissertation from Sölvegatan 14 A, 223 62 Lund , Sweden

    Author : Martin Lagerholm; Lunds universitet.; Lund University.; [1998]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Potts; combinatorial optimization; ANN; mean field; approximation; routing; unicast; multicast; airline crew; scheduling; ECG; NP-complete.; Matematik; Mathematics; algorithm; Systems engineering; computer technology; Data- och systemvetenskap; Fysicumarkivet A:1998:Lagerholm;

    Abstract : Popular Abstract in Swedish Denna avhandling behandlar komplexa optimerings problem med artificiella neuron nätverk (ANN) tekniker och diverse verktyg från den teoretiska fysiken. För många typer av komplexa optimerings problem kan den mänskliga hjärnan prestera ett snabbt och hyfsat bra svar. READ MORE

  2. 2. Approximation and Online Algorithms with Applications in Computational Biology and Computational Geometry

    University dissertation from Department of Computer Science, Lund University

    Author : Mia Persson; Lunds universitet.; Lund University.; [2006]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; numerisk analys; system; systems; control; Datalogi; numerical analysis; broadcasting; polygon exploration; robotics; Mathematics; Matematik; Computer science; clique partition; clustering; computational complexity; computational geometry; computational biology; online algorithm; kontroll; approximation algorithm;

    Abstract : The main contributions of this thesis are in the area of approximation and online algorithm design and derivation of lower bounds on the approximability for a number of combinatorial optimization problems with applications in computational biology and computational geometry. Approximation and online algorithms are fundamental tools used to deal with computationally hard problems and problems in which the input is gradually disclosed over time. READ MORE

  3. 3. On the Identification and Approximation of Linear Systems

    University dissertation from Linköping : Linköping University

    Author : Bo Wahlberg; Linköpings universitet.; Linköpings universitet.; [1987]
    Keywords : TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Identification; Approximation; Linear systems;

    Abstract : This thesis consists of four parts. In the first one, the connections between system identification and model reduction are discussed. The second part deals with the problem of estimating ARMA models for narrow band processes. READ MORE

  4. 4. Analysis of Algorithms for Combinatorial Auctions and Related Problems

    University dissertation from Uppsala : Matematiska institutionen

    Author : Kidane Asrat Ghebreamlak; Uppsala universitet.; [2005]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; combinatorial auctions; approximation algorithm; greedy algorithm; optimal strategy; MATHEMATICS; MATEMATIK;

    Abstract : The thesis consists of four papers on combinatorial auctions and a summary. The first part is more of a practical nature and contains two papers. In the first paper, we study the performance of a caching technique in an optimal algorithm for a multi-unit combinatorial auction. READ MORE

  5. 5. Algorithms in data mining using matrix and tensor methods

    University dissertation from Matematiska institutionen

    Author : Berkant Savas; Linköpings universitet.; Linköpings universitet.; [2008]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Volume; Minimization criterion; Determinant; Rank deficient matrix; Reduced rank regression; System identification; Rank reduction; Volume minimization; General algorithm; Handwritten digit classification; Tensors; Higher order singular value decomposition; Tensor approximation; Least squares; Tucker model; Multilinear algebra; Notation; Contraction; Tensor matricization; Newton s method; Grassmann manifolds; Product manifolds; Quasi-Newton algorithms; BFGS and L-BFGS; Symmetric tensor approximation; Local intrinsic coordinates; Global embedded coordinates; ; MATHEMATICS Applied mathematics Numerical analysis; MATEMATIK Tillämpad matematik Numerisk analys;

    Abstract : In many fields of science, engineering, and economics large amounts of data are stored and there is a need to analyze these data in order to extract information for various purposes. Data mining is a general concept involving different tools for performing this kind of analysis. READ MORE