Essays about: "slumpmässiga grafer"
Showing result 1 - 5 of 7 essays containing the words slumpmässiga grafer.
-
1. Modelling Cyber Security of Networks as a Reinforcement Learning Problem using Graphs : An Application of Reinforcement Learning to the Meta Attack Language
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : ICT systems are part of the vital infrastructure in today’s society. These systems are under constant threat and efforts are continually being put forth by cyber security experts to protect them. By applying modern AI methods, can these efforts both be improved and alleviated of the cost of expert work. READ MORE
-
2. Graph Complexity Based on a Heuristic That Involves the Algorithmic Complexity Behaviour of Multiplex Networks on Graphs
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Since determining the complexity of multiplex networks is an NP-hard problem, I decided to calculate the complexity of graphs using heuristics. I am the first in this path who did these kinds of calculations. I always wanted to define complexity as a mathematical characteristic in the structure of graphs. READ MORE
-
3. Detecting quantum speedup for random walks with artificial neural networks
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Random walks on graphs are an essential base for crucial algorithms for solving problems, like the boolean satisfiability problem. A speedup of random walks could improve these algorithms. The quantum version of the random walk, quantum walk, is faster than random walks in specific cases, e.g. READ MORE
-
4. Building Distributed Systems for Fresh and Low-latency Data Delivery for Internet of Things
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Internet of Things (IoT) is a system of interrelated computing devices with the ability to transfer data over the network and collected by the applications that rely on fresh information, where the freshness of data can be measured by a metric called Age of Information (AoI). Age of Information is the time that is measured by the receiving node from the time the data has generated at the source. READ MORE
-
5. Deep Learning Models for Route Planning in Road Networks
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Traditional shortest path algorithms can efficiently find the optimal paths in graphs using simple heuristics. However, formulating a simple heuristic is challenging under the road network setting since there are multiple factors to consider, such as road segment length, edge centrality, and speed limit. READ MORE
