Sökning: "Datastrukturer"

Visar resultat 1 - 5 av 48 uppsatser innehållade ordet Datastrukturer.

  1. 1. Customizable Contraction Hierarchies for Mixed Fleet Vehicle Routing : Fast weight customization when not adhering to triangle inequality

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

    Författare :Martin Larsson; [2023]
    Nyckelord :Contraction Hierarchies; Customizable Contraction Hierarchies; Vehicle Routing Problem; Battery Electric Vehicles; Mixed Fleet; Kontraktionshierarkier; Anpassningsbara Kontraktionshierarkier; Ruttplanering; Batteridrivna elfordon; Blandad fordonsflotta;

    Sammanfattning : As the transport industry shifts towards Battery Electric Vehicles (BEVs) the need for accurate route planning rises. BEVs have reduced range compared to traditional fuel based vehicles, and the range can vary greatly depending on ambient conditions and vehicle load. LÄS MER

  2. 2. 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)

    Författare :Emmy Yin; [2023]
    Nyckelord :Dynamic Graphs; Graph Layout Algorithms; Visualization; Hierarchical Graph Layouts; Dynamiska grafer; grafritningsalgoritmer; visualisering; hierarkiska grafritningar;

    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

  3. 3. Detection of Prototype Pollution Using Joern : Joern’s Detection Capability Compared to CodeQL’s

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

    Författare :Tobias Fröberg; [2023]
    Nyckelord :CodeQL; Computer security; JavaScript; Joern; Prototype pollution; Vulnerability detection; CodeQL; Datorsäkerhet; JavaScript; Joern; Prototypförorening; Sårbarhetsdetektering;

    Sammanfattning : JavaScript-built programs are widely used by the general public, but they are also vulnerable to JavaScript-related exploits stemming from the newly discovered prototype pollution vulnerability. Research has been focused on understanding the impact of this vulnerability and finding ways to detect it using code analysis tools. LÄS MER

  4. 4. A comparison of neuron touch detection algorithms utilising voxelization and the data structures octree, k-d tree and R-tree

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

    Författare :Jonathan Gustaf Cilli; Karin De Verdier; [2023]
    Nyckelord :;

    Sammanfattning : Simulations of biologically detailed neuronal networks have become an essential tool in the study of the brain. An important step in the creation of these types of simulations is the detection of the connections between the nerve cells. This paper analyses the efficiency of four algorithms used for such purposes. LÄS MER

  5. 5. Minimization of Model-based Tests in Modbat

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

    Författare :Caroline Borg; [2023]
    Nyckelord :Software testing; Model-based testing; Test minimization; Delta debugging; Modbat; modmin; Mjukvarutestning; Modellbaserad testning; Testminimering; Delta debugging; Modbat; modmin;

    Sammanfattning : Model-based testing (MBT) is a promising testing method with advantages like exhaustive exploration and high maintainability. However, one notable downside is that the generated tests usually contain much unnecessary noise. LÄS MER