Sökning: "Online Shortest Path Problem"

Hittade 5 avhandlingar innehållade orden Online Shortest Path Problem.

  1. 1. Online Learning for Energy Efficient Navigation in Stochastic Transport Networks

    Författare :Niklas Åkerblom; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Thompson Sampling; Online Minimax Path Problem; Multi-Armed Bandits; Online Learning; Online Shortest Path Problem; Machine Learning; Combinatorial Semi-Bandits; Energy Efficient Navigation;

    Sammanfattning : Reducing the dependence on fossil fuels in the transport sector is crucial to have a realistic chance of halting climate change. The automotive industry is, therefore, transitioning towards an electrified future at an unprecedented pace. LÄS MER

  3. 2. From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry

    Författare :Mikael Hammar; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; system; numerisk analys; Datalogi; systems; control; numerical analysis; Approximation Algorithms; Computational Geometry; Online Algorithms; Art Gallery Problem; Linear Search; Traveling Salesman Problem; R-Tree; Delaunay Triangulation; Polygon Exploration; Computer science; Shortest Watchman Routes; kontroll; Mathematics; Matematik;

    Sammanfattning : We give approximation and online algorithms as well as data structures for some well studied problems in computational geometry. The thesis is divided into three parts. In part one, we study problems related to guarding, exploring and searching geometric environments. LÄS MER

  4. 3. Online Combinatorial Optimization under Bandit Feedback

    Författare :Mohammad Sadegh Talebi Mazraeh Shahi; Alexandre Proutiere; Vianney Perchet; KTH; []
    Nyckelord :Combinatorial Optimization; Online Learning; Multi-armed Bandits; Sequential Decision Making; Matematik; Mathematics; Datalogi; Computer Science;

    Sammanfattning : Multi-Armed Bandits (MAB) constitute the most fundamental model for sequential decision making problems with an exploration vs. exploitation trade-off. In such problems, the decision maker selects an arm in each round and observes a realization of the corresponding unknown reward distribution. LÄS MER

  5. 4. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization

    Författare :Jan van den Brand; Danupon Na Nongkai; Santosh Vempala; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Dynamic Algorithm; Data Structure; Optimization; Linear Program; Bipartite Matching; Shortest Path; Maximum Flow; Minimum Cost Flow; Diameter; Computer Science; Datalogi;

    Sammanfattning : Dynamic algorithms are used to efficiently maintain solutions to problems where the input undergoes some changes.This thesis studies dynamic algorithms that maintain solutions to linear algebra problems and we explore their applications and implications for dynamic graphs and optimization problems. LÄS MER

  7. 5. Real-time communication in wireless lossy networks

    Författare :Zhenhua Zou; Mikael Johansson; Ness B. Shroff; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY;

    Sammanfattning : The last decades’ tremendous advances in wireless communications havebeen driven mainly by personal communications. Radio resource allocationmechanisms for optimizing key metrics, such as average throughput and delay,are by now rather well-developed. LÄS MER