Sökning: "dynamisk graf"
Visar resultat 1 - 5 av 9 uppsatser innehållade orden dynamisk graf.
1. Preserving the Mental Map when Visualizing Dynamic Graphs : An Approach for Intermediate Representations in the C2 Java Compiler
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Graphs are powerful data structures that are widely used to represent complex forms of information. One area in which graphs are successfully being used is within compiler engineering, where a program under compilation can be represented as a graph that changes as the program is being compiled. LÄS MER
2. Graph Bandits : Multi-Armed Bandits with Locality Constraints
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Multi-armed bandits (MABs) have been studied extensively in the literature and have applications in a wealth of domains, including recommendation systems, dynamic pricing, and investment management. On the one hand, the current MAB literature largely seems to focus on the setting where each arm is available to play at each time step, and ignores how agents move between the arms. LÄS MER
3. Traffic Prediction From Temporal Graphs Using Representation Learning
Master-uppsats, KTH/Matematisk statistikSammanfattning : With the arrival of 5G networks, telecommunication systems are becoming more intelligent, integrated, and broadly used. This thesis focuses on predicting the upcoming traffic to efficiently promote resource allocation, guarantee stability and reliability of the network. LÄS MER
4. Dynamic Graph Embedding on Event Streams with Apache Flink
Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)Sammanfattning : Graphs are often considered an excellent way of modeling complex real-world problems since they allow to capture relationships between items. Because of their ubiquity, graph embedding techniques have occupied research groups, seeking how vertices can be encoded into a low-dimensional latent space, useful to then perform machine learning. LÄS MER
5. Dynamisk fyllnad av flödesfält för vägplanering
Kandidat-uppsats, Högskolan i Skövde/Institutionen för informationsteknologiSammanfattning : Den här undersökningen har jämfört ifall ett gemensamt dynamiskt flödesfält som fylls allteftersom kan prestera bättre än när varje agent måste fylla sitt eget flödesfält. Ett antal scenarion har skapats för att ta reda på vilket sätt teknikerna skiljer sig. LÄS MER