Sökning: "greedy algorithm"
Visar resultat 1 - 5 av 30 avhandlingar innehållade orden greedy algorithm.
1. Signal Processing Techniques in Mobile Communication Systems : Signal Separation, Channel Estimation and Equalization
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
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
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
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
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