Sökning: "exact cover"

Visar resultat 1 - 5 av 23 uppsatser innehållade orden exact cover.

  1. 1. Efficiently Solving the Exact Cover Problem in OpenMP

    Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Leo Hall; [2023]
    Nyckelord :Exact Cover; openmp; parallelization;

    Sammanfattning : 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. LÄS MER

  3. 2. Hinder och möjligheter med återbruk : -En fallstudie baserad på återanvändning av fönster och innerdörrar från Skellefteå lasarett

    Uppsats för yrkesexamina på grundnivå, Umeå universitet/Institutionen för tillämpad fysik och elektronik

    Författare :Jonas Hildingsson; [2023]
    Nyckelord :återbruk; cirkulär ekonomi; byggteknik; materialinventering; klimatbesparing;

    Sammanfattning : By creating an understanding of reuse, waste within the construction sector can be reduced. The purpose of this report is therefore to identify the obstacles and opportunities of reuse based on a case study regarding the recycling of specifically requested building materials by a company. LÄS MER

  4. 3. Using forest reflectance modelling to estimate albedo for narrow-view satellites

    Master-uppsats, Lunds universitet/Institutionen för naturgeografi och ekosystemvetenskap; Lunds universitet/Fysiska institutionen

    Författare :Nick Bergmans; [2023]
    Nyckelord :satellite; remote sensing; albedo; surface reflectance; vegetation; forest; machine learning; albedo estimation; Earth and Environmental Sciences;

    Sammanfattning : Surface albedo estimations from remote sensing are invaluable for energy balance descrip- tions in climate research. The aim of this work is to evaluate the possibility of using Sentinel-2 satellite data to get the total albedo of a small, vegetated area. LÄS MER

  5. 4. Using MPI One-Sided Communication for Parallel Sudoku Solving

    Kandidat-uppsats, Umeå universitet/Institutionen för datavetenskap

    Författare :Henrik Aili; [2023]
    Nyckelord :exact cover; sudoku; parallelization; MPI;

    Sammanfattning : This thesis investigates the scalability of parallel Sudoku solving using Donald Knuth’s Dancing Links and Algorithm X with two different MPI communication methods: MPI One-Sided Communication and MPI Send-Receive. The study compares the performance of the two communication approaches and finds that MPI One-Sided Communication exhibits better scalability in terms of speedup and efficiency. LÄS MER

  7. 5. Czekanowski’s Clustering : Development of Visualization Possibilities of the RMaCzek Package

    Master-uppsats, Linköpings universitet/Statistik och maskininlärning

    Författare :Ying Luo; [2022]
    Nyckelord :Cluster Analysis; Graph Visualization; Czekanowski’s Diagram; Seriation Methods; Changing Points Detection;

    Sammanfattning : As one of the most essential data mining tasks, clustering analysis has been widely discussed and employed since its invention. Czekanowski’s diagram, which has been around for over a century as a visualization tool for exploring cluster distributions, is being improved continually. LÄS MER