Essays about: "graph partitioning"
Showing result 1 - 5 of 18 essays containing the words graph partitioning.
-
1. Highly Available Task Scheduling in Distinctly Branched Directed Acyclic Graphs
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : Big data processing frameworks utilizing distributed frameworks to parallelize the computing of datasets have become a staple part of the data engineering and data science pipelines. One of the more known frameworks is Dask, a widely utilized distributed framework used for parallelizing data processing jobs. READ MORE
-
2. Simulations of Point Processes on Directed Graphs
University essay from Uppsala universitet/Institutionen för informationsteknologiAbstract : Simulating a point process where the events correspond to vehicle collisions on a road networkcan be quite computationally heavy due to the large number of elements that are necessary toprovide a sufficient discretization of the network. This paper aims to present a computationallyefficient solution for simulating events of a point process. READ MORE
-
3. Place and Route Algorithms for a Neuromorphic Communication Network Simulator
University essay from Linköpings universitet/DatorteknikAbstract : In recent years, neural networks have seen increased interest from both the cognitive computing and computation neuroscience fields. Neuromorphic computing systems simulate neural network efficiently, but have not yet reached the amount of neurons that a mammal has. READ MORE
-
4. Approaching sustainable mobility utilizing graph neural networks
University essay from Högskolan i Halmstad/Akademin för informationsteknologiAbstract : This report is done in collaboration with WirelessCar for the master of science thesis at Halmstad University. Many different parameters influence fuel consumption. The objective of the report is to evaluate if Graph neural networks are a practical model to perform fuel consumption prediction on areas. READ MORE
-
5. Streaming Graph Partitioning with Graph Convolutional Networks
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : In this work, we present a novel approach to the streaming graph partitioning problem which handles unbounded streams.Graph partitioning is a process of dividing a graph into groups of nodes or edges. READ MORE