Essays about: "graph search"

Showing result 1 - 5 of 59 essays containing the words graph search.

  1. 1. Comparing Quantum Annealing and Simulated Annealing when Solving the Graph Coloring Problem

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Nora Odelius; Isak Reinholdsson; [2023]
    Keywords : Quantum Computing; Quantum Annealing; Simulated Annealing; Graph Coloring Problem; Kvantberäkningar; Quantum Annealing; Simulated Annealing; Graffärgningsproblemet;

    Abstract : Quantum annealing (QA) is an optimization process in quantum computing similar to the probabilistic metaheuristic simulated annealing (SA). The QA process involves encoding an optimization problem into an energy landscape, which it then traverses in search for the point of minimal energy representing the global optimal state. READ MORE

  3. 2. Trigger-Level Multiple Electron Event Classification with LDMX using Artificial Neural Networks

    University essay from Lunds universitet/Partikel- och kärnfysik; Lunds universitet/Fysiska institutionen

    Author : Jacob Lindahl; [2023]
    Keywords : LDMX; ANN; CNN; GNN; RNN; DM; Physics and Astronomy;

    Abstract : Artificial neural networks is a powerful tool for classifying and identifying patterns in large amounts of data. One of the possible tasks of these networks is classification of data into categories. READ MORE

  4. 3. Reinforcement learning for improved local search : Applied to the graph coloring problem

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Adrian Salamon; Klara Sandström; [2023]
    Keywords : ;

    Abstract : The graph coloring problem (GCP) is an important combinatorial optimization problem (COP) with various applications and a simple formulation: to assign colors to vertices in a graph such that no adjacent vertices share a color. The GCP is NP-hard, and in order to solve it within a reasonable time frame, heuristic local search (LS) based algorithms are commonly used. READ MORE

  5. 4. Extending applicability of symbolic execution to uncover possible shared memory transactions in GPU programs

    University essay from Linköpings universitet/Institutionen för datavetenskap

    Author : Jonathan Hjort; [2022]
    Keywords : ;

    Abstract : General-purpose computing on the graphics processing unit has become popular since the cost-to-power ratio is lower for GPUs (compared to CPUs) and the programmability of the GPU has increased. CUDA is an extension of the C/C++ programming languages which enables software developers to more easily make use of the computational power of the GPUs. READ MORE

  6. 5. Modelling Cyber Security of Networks as a Reinforcement Learning Problem using Graphs : An Application of Reinforcement Learning to the Meta Attack Language

    University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Author : Sandor Berglund; [2022]
    Keywords : Attack graphs; reinforcement learning; graph neural networks; Meta Attack Language; MAL; deepQ-learning DQN ; Attackgrafer; förstärningsinlärning; artificiella neuronnät; grafneuronnät; djup Qinlärning; Meta Attack Language; MAL;

    Abstract : ICT systems are part of the vital infrastructure in today’s society. These systems are under constant threat and efforts are continually being put forth by cyber security experts to protect them. By applying modern AI methods, can these efforts both be improved and alleviated of the cost of expert work. READ MORE