Sökning: "Constraint Solving Problems"

Visar resultat 1 - 5 av 30 uppsatser innehållade orden Constraint Solving Problems.

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

    Uppsats för yrkesexamina på avancerad nivå, Uppsala universitet/Signaler och system

    Författare :Oskar Falkeström; [2023]
    Nyckelord :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.;

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

  3. 2. Adjoint optimization of a liquid-cooled heat sink

    Master-uppsats, KTH/Teknisk mekanik

    Författare :Roven Pinto; [2023]
    Nyckelord :Adjoint method; topology optimization; porosity; OpenFOAM;

    Sammanfattning : Improving the design of flow channels in a liquid-cooled heat sink is critical for boosting the capabilities of electronic components as well as reducing energy usage by the pump. This work explores the use of topology optimization to minimize the pressure difference across a heat sink and consequently, the energy used to supply the liquid. LÄS MER

  4. 3. Contributions to a New CBLS Backend for MiniZinc

    Master-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Maarten Lucas Flippo; [2022]
    Nyckelord :;

    Sammanfattning : MiniZinc is a language which enables the modelling of combinatorial optimisation and satisfaction problems independently from any particular problem solver and its technology. One technology for solving combinatorial optimisation and satisfaction problems is constraint-based local search (CBLS). LÄS MER

  5. 4. Recording and Minimising Nogoods from Restarts in the Solver MiniCP

    Master-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Mika Skjelnes; [2022]
    Nyckelord :;

    Sammanfattning : Systematic search is a typical search algorithm in Constraint Programming. The solving performance of this search algorithm is affected by the heavy-tailed phenomenon, which can cause search to spend significant time exploring subtrees that contain no solutions to the problem instance. LÄS MER

  7. 5. Invariant Propagation for Solvers of Constraint-Based Local Search Technology

    Master-uppsats, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Samuel Bodin; [2022]
    Nyckelord :;

    Sammanfattning : Constraint-based local search is a technology for solving constrained optimisation problems and constraint satisfaction problems. Solvers of this kind rely on the notion of invariants and an invariant propagation algorithm during search. LÄS MER