Sökning: "Constraint satisfaction"

Visar resultat 1 - 5 av 24 uppsatser innehållade orden Constraint satisfaction.

  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. Introducing GA-SSNN: A Method for Optimizing Stochastic Spiking Neural Networks : Scaling the Edge User Allocation Constraint Satisfaction Problem with Enhanced Energy and Time Efficiency

    Master-uppsats, KTH/Skolan för elektroteknik och datavetenskap (EECS)

    Författare :Nathan Allard; [2023]
    Nyckelord :;

    Sammanfattning : As progress within Von Neumann-based computer architecture is being limited by the physical limits of transistor size, neuromorphic comuting has emerged as a promising area of research. Neuromorphic hardware tends to be substantially more power efficient by imitating the aspects of computations in networks of neurons in the brain. 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. 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

  7. 5. A Linter for Static Analysis of MiniZinc Models

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

    Författare :Erik Rimskog; [2021]
    Nyckelord :linter MiniZinc combinatorial optimisation static analysis models;

    Sammanfattning : MiniZinc is a modelling language for constraint satisfaction and optimisation problems. It can be used to solve difficult problems by declaratively modelling them and giving them to a generic solver. A linter, a tool for static analysis, is implemented for MiniZinc to provide analysis for improving models. LÄS MER