Sökning: "Traditionella algoritmen"

Visar resultat 16 - 20 av 43 uppsatser innehållade orden Traditionella algoritmen.

  1. 16. Jämförelse mellan graf- och relationsdatabas : En studie av prestanda vid sökning av kortaste vägen mellan två givna platser i ett rälsbundet nätverk

    Kandidat-uppsats, Högskolan Dalarna/Institutionen för information och teknik

    Författare :Jimmy Nilsson; Johan Hansson; [2021]
    Nyckelord :Relational Database; Graph Database; SQL Server; Neo4j; Comparison; Performance; Response Times; Relationsdatabas; Grafdatabas; SQL Server; Neo4j; Jämförelse; Prestanda; Svarstider;

    Sammanfattning : Traditional relational databases store data in tabular form and have existed for several decades. The new requirements for data such as high availability and scalability have led to an increase in NoSQL databases in popularity. LÄS MER

  3. 17. Research on Dynamic Offloading Strategy of Satellite Edge Computing Based on Deep Reinforcement Learning

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Rui Geng; [2021]
    Nyckelord :Deep reinforcement learning; Satellite edge computing; Offloading strategy; Djup Förstärkning Lärande; Satellit Kant Datoranvändning; Avlastning Strategi;

    Sammanfattning : Nowadays more and more data is generated at the edge of the network, and people are beginning to consider decentralizing computing tasks to the edge of the network. The network architecture of edge computing is different from the traditional network architecture. LÄS MER

  4. 18. Optimization and automatization of end-bearing pile groups

    Master-uppsats, KTH/Bro- och stålbyggnad

    Författare :Gabriel Antonio Del Pozo Alarcon; [2021]
    Nyckelord :Optimization; automatization; pile groups; Optimering; automatisering; pålgrupper;

    Sammanfattning : This thesis consists of the development, trial an application of a computational tool that by the use of the Genetic Algorithm optimization method provides the user with an alternative approach from the traditional trial and error when faced with the challenge of designing end bearing pile groups.The work presents the three main concepts needed for understanding the computational tool as well as the structure of it. LÄS MER

  5. 19. Time-Series Feature Extraction in Embedded Sensor Processing System

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Wenyao Zhu; [2020]
    Nyckelord :;

    Sammanfattning : Embedded sensor-based systems mounted with tens or hundreds of sensors can collect enormous time-series data, while the data analysis on those time-series is commonly conducted on the remote server-side. With the development of microprocessors, there have been increasing demands to move the analysis process to the local embedded systems. LÄS MER

  7. 20. Streaming Graph Partitioning with Graph Convolutional Networks

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Michal Zwolak; [2020]
    Nyckelord :;

    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