Essays about: "approximation algorithms"

Showing result 11 - 15 of 81 essays containing the words approximation algorithms.

  1. 11. Path Choice Estimation in Urban Rails : Asimulation based optimisation for frequency-based assignment model

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Alexander Adolfsson; [2022]
    Keywords : Black-Box Optimisation; Optimization; Simulation based optimisation; Transit Network; Automaton; Urban Transport; Public transportation; Black-Box optimering; Optimering; Simuleringsbaserad Optimering; Transportsystem; Automation; Local Transport; Kollektivtrafik;

    Abstract : Transit system have a large importance in modern urban cities, with urban rail often acting as the central system with it efficient travel time and great capacity. As cities grow in population, so to does the usage of urban rail resulting in increased crowding on the platform and in the trains. READ MORE

  3. 12. Sparse Approximation of Spatial Channel Model with Dictionary Learning

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Matilda Zhou; [2022]
    Keywords : Spatial channel model SCM ; dictionary learning; compressive sensing CS ; discrete Fourier transform DFT ; overcomplete discrete Fourier transform ODFT ; Rumslig kanalmodell; ordbokslärning; kompressionsavkänning; diskret Fourier-transform; överkomplett diskret Fourier-transform;

    Abstract : In large antenna systems, traditional channel estimation is costly and infeasible in some situations. Compressive sensing was proposed to estimate the channel with fewer measurements. Most of the previous work uses a predefined discrete Fourier transform matrix or overcomplete Fourier transform matrix to approximate the channel. READ MORE

  4. 13. Implementation of a Fast Approximation Algorithm for Precedence Constrained Scheduling

    University essay from Linköpings universitet/Tillämpad matematik; Linköpings universitet/Tekniska fakulteten

    Author : Måns Alskog; [2022]
    Keywords : Optimization; scheduling; approximation algorithms; linear programming; multiplicative weight update; Optimering; schemaläggning; approximationsalgoritmer; linjärprogrammering;

    Abstract : We present an implementation of a very recent approximation algorithm for scheduling jobs on a single machine with precedence constraints, minimising the total weighted completion time. We also evaluate the performance of this implementation. READ MORE

  5. 14. The V-SLAM Hurdler : A Faster V-SLAM System using Online Semantic Dynamic-and-Hardness-aware Approximation

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Liu Mingxuan; [2022]
    Keywords : Approximate Computing; Deep Learning; Dynamic Environments; Object Detection; Online Controller; Semantic SLAM; Ungefärlig Beräkning; Djup Lärning; Dynamiska miljöer; Objektdetektion; Online Kontroller; Semantisk SLAM;

    Abstract : Visual Simultaneous Localization And Mapping (V-SLAM) and object detection algorithms are two critical prerequisites for modern XR applications. V-SLAM allows XR devices to geometrically map the environment and localize itself within the environment, simultaneously. READ MORE

  6. 15. Quantum Annealing Algorithms for PAPR Minimisation in Wireless Networks

    University essay from Uppsala universitet/Materialteori

    Author : David Bern; [2022]
    Keywords : Quantum Mechanics; Algorithms; Quantum Annealing; Graph representation;

    Abstract : In this thesis, we devise a scheme to run PAPR minimisation with 3GPP EVM requirement as constraint on the D-Wave Systems’ quantum annealer. The PAPR minimisation is a problem central to optimising the costs and performance of wireless networks becoming increasingly difficult for larger OFDM-MIMO systems, while the EVM constraint needs to be satisfied to reach an industry standard performance. READ MORE