Essays about: "NP-Hard"

Showing result 6 - 10 of 63 essays containing the word NP-Hard.

  1. 6. 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

  3. 7. Automatic text placement on maps using deep learning keypoint detection models

    University essay from Lunds universitet/Institutionen för naturgeografi och ekosystemvetenskap

    Author : Azin Khosravi Khorashad; [2022]
    Keywords : machine learning; Stacked hourglass networks; attention mechanism; CNN; geomatics; Earth and Environmental Sciences;

    Abstract : Labeling the map is one of the most essential parts of the cartographic process that requires a huge time and energy. It is proven that the automation of map labeling is an NP-hard problem. There have been many research studies that tried to solve it such as rule-based methods, metaheuristics, and integer programming. READ MORE

  4. 8. Implementation of the signature scheme Rainbow on SoC FPGA

    University essay from Uppsala universitet/Institutionen för informationsteknologi

    Author : Tomas Preucil; [2022]
    Keywords : ;

    Abstract : Thanks to the research progress, quantum computers are slowly becoming a reality, and some companies already have working prototypes. While this is great news for some, it also means that part of the encryption used today will be rendered unsafe and obsolete. READ MORE

  5. 9. Randomized heuristic scheduling of electrical distribution network maintenance in spatially clustered balanced zones

    University essay from KTH/Geoinformatik

    Author : Carolina Offenbacher; Ellen Thornström; [2022]
    Keywords : Capacitated Vehicle Routing Problem; Electrical distribution network; Heuristic algorithm; Scheduling; Handelsresandeproblemet; Eldistributionsnätverk; Heurustik algortim; Schemaläggning;

    Abstract : Reliable electricity distribution systems are crucial; hence, the maintenance of such systems is highly important, and in Sweden strictly regulated. Poorly planned maintenance scheduling leads unnecessary driving which contributes to increased emissions and costs. READ MORE

  6. 10. Discrete Flower Pollination Algorithm for the Graph Coloring Problem

    University essay from KTH/Datavetenskap

    Author : Samuel Falk; Erik Nordlöf; [2022]
    Keywords : ;

    Abstract : The graph coloring problem (GCP) is a famous NP-hard problem applicable to many real-world problems. The Flower Pollination Algorithm (FPA) is a relatively recently developed algorithm based on the pollination-behaviors of flowers. It has seen great results in single- and multi-objective optimization in continuous search spaces. READ MORE