Essays about: "discrete algorithm"

Showing result 1 - 5 of 114 essays containing the words discrete algorithm.

  1. 1. Using search based methods for beamforming

    University essay from Uppsala universitet/Avdelningen för systemteknik

    Author : Adam Bergman Karlsson; [2024]
    Keywords : Beamforming; Artificial Intelligence; AlphaZero; Radio Resource Management; Monte Carlo Tree Search;

    Abstract : In accommodating the growing global demand for wireless, Multi-User Multiple-Input and Multiple-Output (MU-MIMO) systems have been identified as the key technology. In such systems, a transmitting basestation serves several users simultaneously, increasing the network capacity. READ MORE

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

    University essay from KTH/Skolan för teknikvetenskap (SCI)

    Author : Mattias Olofsson; [2023]
    Keywords : Matematisk Statistik;

    Abstract : 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. READ MORE

  4. 3. Control Aid Implementation -Modelling and simulation of triple extruder-

    University essay from Lunds universitet/Kemiteknik (CI)

    Author : Karl Langsér; [2023]
    Keywords : Machine Learning; Extruder; Modelling; Simulation; Extreme learning machine; Chemical engineering; Technology and Engineering;

    Abstract : In the production of their High Voltage Direct Current Cables (HVDC) and High Voltage Alternating Current Cables (HVAC), NKT uses triple extruders to create layers of insulation and semi-conduction. A model to predict the effect of extruder inputs on the cable’s insulation and semi-conducting layers has been created and trained to predict the extruder in discrete time. READ MORE

  5. 4. Empirical Evaluation of Construction Methods for Relaxed Decision Diagrams in Scheduling

    University essay from Linköpings universitet/Programvara och system

    Author : Dennis Berntsson; [2023]
    Keywords : Decision diagrams; Discrete optimization; Dynamic programming; Scheduling; Top-down compilation; Incremental refinement;

    Abstract : Decision diagrams have recently emerged as a promising approach for difficult scheduling problems, along with other challenging discrete optimization problems. Decision diagrams can offer a compact representation of the solution space, and has the ability to capture complex constraints that are hard to model or express in other techniques. READ MORE

  6. 5. A Bayesian Bee Colony Algorithm for Hyperparameter Tuning of Stochastic SNNs : A design, development, and proposal of a stochastic spiking neural network and associated tuner

    University essay from Uppsala universitet/Signaler och system

    Author : Oskar Falkeström; [2023]
    Keywords : edge computing; edge user allocation; constraint satisfaction problem; bin packing problem; spiking neural networks; SNN; stochastic spiking neural networks; neuromorphic computing; hyperparameter tuning; swarm intellience; artificial bee colony algorithm; tree-structured Parzen estimator; stochastic optimization; Bayesian optimization.;

    Abstract : With the world experiencing a rapid increase in the number of cloud devices, continuing to ensure high-quality connections requires a reimagining of cloud. One proponent, edge computing, consists of many distributed and close-to-consumer edge servers that are hired by the service providers. READ MORE