Essays about: "NP complete"
Showing result 1 - 5 of 32 essays containing the words NP complete.
-
1. Efficiently Solving the Exact Cover Problem in OpenMP
University essay from Umeå universitet/Institutionen för datavetenskapAbstract : The exact cover problem is an NP-complete problem with many widespread use cases such as crew scheduling, railway scheduling, benchmarking as well as having applications in set theory. Existing algorithms can be slow when dealing with large datasets however. READ MORE
-
2. The Examination of Alternative Methods for Sperm Cell Lysis and Purification of Sexual Assault Samples
University essay from Lunds universitet/Teknisk mikrobiologiAbstract : Forensic sexual assault samples typically contain a mixture of a small quantity of sperm cells and a high quantity of epithelial cells. This relationship complicates the generation of a DNA profile, which prompts the need for differential lysis and extraction of the DNA. READ MORE
-
3. Comparison of Two Constraint Solvers for University Timetable Creation with Focus on Algorithm Choices
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : The problem of finding an optimal schedule for universities based on their numerous constraints is NP-complete and thus requires heuristics to get good solutions. Our study has compared two constraint solvers that employ different combinations of heuristics to determine which is more suitable for universities. READ MORE
-
4. Edge Service Selection in a Virtual Service Marketplace
University essay from KTH/Skolan för elektroteknik och datavetenskap (EECS)Abstract : A brokerless edge service marketplace could play a significant role in enabling an eco- system where a large number of edge providers and Communication Service Providers (CSPs) offer Mobile Edge Infrastructure Services (EISs) to providers of edge-based applications and services. The marketplace would be the bridge between EIS providers and their customers, managing the relations between actors in the mobile edge eco- system. READ MORE
-
5. Modelling Hierarchical Structures in Networks Using Graph Theory : With Application to Knowledge Networks in Graph Curricula
University essay from Uppsala universitet/Signaler och systemAbstract : Community detection is a topic in network theory that involves assigning labels to nodes based on some distance measure or centrality index. Detecting communities within a network can be useful to perform information condensation. READ MORE