Sökning: "Graph partitioning"
Visar resultat 1 - 5 av 18 uppsatser innehållade orden Graph partitioning.
1. Highly Available Task Scheduling in Distinctly Branched Directed Acyclic Graphs
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : 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. LÄS MER
2. Simulations of Point Processes on Directed Graphs
Master-uppsats, Uppsala universitet/Institutionen för informationsteknologiSammanfattning : 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. LÄS MER
3. Place and Route Algorithms for a Neuromorphic Communication Network Simulator
Master-uppsats, Linköpings universitet/DatorteknikSammanfattning : 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. LÄS MER
4. Approaching sustainable mobility utilizing graph neural networks
Uppsats för yrkesexamina på avancerad nivå, Högskolan i Halmstad/Akademin för informationsteknologiSammanfattning : 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. LÄS MER
5. Streaming Graph Partitioning with Graph Convolutional Networks
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : 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. LÄS MER