Search for dissertations about: "Online Shortest Path Problem"
Found 5 swedish dissertations containing the words Online Shortest Path Problem.
-
1. Online Learning for Energy Efficient Navigation in Stochastic Transport Networks
Abstract : 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. READ MORE
-
2. From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry
Abstract : 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. READ MORE
-
3. Online Combinatorial Optimization under Bandit Feedback
Abstract : 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. READ MORE
-
4. Dynamic Matrix Algorithms and Applications in Convex and Combinatorial Optimization
Abstract : 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. READ MORE
-
5. Real-time communication in wireless lossy networks
Abstract : 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. READ MORE