Sökning: "greedy algorithm"

Visar resultat 1 - 5 av 32 avhandlingar innehållade orden greedy algorithm.

  1. 1. Signal Processing Techniques in Mobile Communication Systems : Signal Separation, Channel Estimation and Equalization

    Författare :Ronnie Landqvist; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; wireless mobile communications; signal processing; blind source separation; independent component analysis; beamforming; water filling; greedy algorithm; exact eigendecomposition; eigenvector algorithm; multiple-input multiple-output systems; the projection approximation subspace tracking algorithm with and without deflation; linear and non-linear principal component analysis; whitening; decorrelation; equalization; antenna arrays;

    Sammanfattning : Over the last decade there has been an explosive growth in the use of wireless mobile communications. Second generations systems are mature technologies now and third generation systems and beyond are being implemented and researched. LÄS MER

  3. 2. Analysis of Algorithms for Combinatorial Auctions and Related Problems

    Författare :Kidane Asrat Ghebreamlak; Svante Janson; Arne Andersson; Anders Johansson; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; combinatorial auctions; approximation algorithm; greedy algorithm; optimal strategy; MATHEMATICS; MATEMATIK;

    Sammanfattning : 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. LÄS MER

  4. 3. Greedy Algorithms for Distributed Compressed Sensing

    Författare :Dennis Sundman; Mikael Skoglund; Chatterjee Saikat; Mads Græsbøll Christensen; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : Compressed sensing (CS) is a recently invented sub-sampling technique that utilizes sparsity in full signals. Most natural signals possess this sparsity property. From a sub-sampled vector, some CS reconstruction algorithm is used to recover the full signal. LÄS MER

  5. 4. Enhancing Differential Evolution Algorithm for Solving Continuous Optimization Problems

    Författare :Miguel Leon; Ning Xiong; Yigen Zenlander; Peter Funk; Ronnie Johansson; Mälardalens högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Science; datavetenskap;

    Sammanfattning : Differential Evolution (DE) has become one of the most important metaheuristics during the recent years, obtaining attractive results in solving many engineering optimization problems. However, the performance of DE is not always strong when seeking optimal solutions. It has two major problems in real world applications. LÄS MER

  7. 5. New results about the approximation behavior of the greedy triangulation

    Författare :Christos Levcopoulos; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : In this paper it is shown that there is some constant c, such that for any polygon, with or without holes, with w concave vertices, the length of any greedy triangulation of the polygon is not longer than c x (w + 1) times the length of a minimum weight triangulation of the polygon (under the assumption that no three vertices lie on the same line). A low approximation constant is proved for interesting classes of polygons. LÄS MER