Sökning: "exact algorithm"

Visar resultat 1 - 5 av 98 uppsatser innehållade orden exact algorithm.

  1. 1. Tau-Leaping Implementations outside of chemistry

    Kandidat-uppsats, Lunds universitet/Statistiska institutionen

    Författare :Lotta Kornö; [2024]
    Nyckelord :Tau leaping; Mathematics and Statistics;

    Sammanfattning : Tau-leaping is an algorithm for model simulations most often used in kinetic chemistry. It was created to make simulations more efficient at the cost of some accuracy. However, its uses outside of chemistry are limited but could help make some model simulations more efficient. LÄS MER

  3. 2. An Algorithm for Sampling from Bandlimited Circular Probability Distributions

    Kandidat-uppsats, KTH/Skolan för teknikvetenskap (SCI)

    Författare :Mattias Olofsson; [2023]
    Nyckelord :Matematisk Statistik;

    Sammanfattning : In this Bachelor thesis, a novel algorithm for sampling from bandlimited circular probability distributions is presented. The algorithm leverages results from Fourier analysis concerning the Fejér kernel to simulate data with some desired probability distribution, realized as a sum of data sampled from a discrete distribution and a small continuous perturbation sampled from the Fejér kernel distribution. LÄS MER

  4. 3. Quality enhancement of time-resolved computed tomography scans with cycleGAN

    Master-uppsats, Lunds universitet/Synkrotronljusfysik; Lunds universitet/Fysiska institutionen

    Författare :Johannes Stubbe; [2023]
    Nyckelord :carbon fibers; carbon fibres; microfibers; tomography; deep learning; cycleGAN; time-resolved tomography; Physics and Astronomy;

    Sammanfattning : Time-resolved x-ray tomography enables us to dynamically and non-destructively study the interior of a specimen. The obtainable temporal resolution is limited by the x-ray flux and the desired spatial resolution. LÄS MER

  5. 4. A Conjugate Residual Solver with Kernel Fusion for massive MIMO Detection

    Master-uppsats, Högskolan i Halmstad/Centrum för forskning om tillämpade intelligenta system (CAISR)

    Författare :Ioannis Broumas; [2023]
    Nyckelord :MIMO; massive MIMO; GPU; CUDA; Software Defined Radio; SDR; MMSE; ZF; zero-forcing; parallel detection; iterative methods; conjugate residual; parallel computing; kernel fusion;

    Sammanfattning : This thesis presents a comparison of a GPU implementation of the Conjugate Residual method as a sequence of generic library kernels against implementations ofthe method with custom kernels to expose the performance gains of a keyoptimization strategy, kernel fusion, for memory-bound operations which is to makeefficient reuse of the processed data. For massive MIMO the iterative solver is to be employed at the linear detection stageto overcome the computational bottleneck of the matrix inversion required in theequalization process, which is 𝒪(𝑛3) for direct solvers. LÄS MER

  7. 5. 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