Sökning: "Constraint Satisfaction Problem"

Visar resultat 1 - 5 av 16 uppsatser innehållade orden Constraint Satisfaction Problem.

  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. Efficient Security Protocol for RESTful IoT devices

    Master-uppsats, Lunds universitet/Institutionen för elektro- och informationsteknik

    Författare :Karnarjun Kantharajan; Sahar Shirafkan; [2020]
    Nyckelord :Internet of Things IoT ; TLS 1.2 1.3; DTLS 1.2; OSCORE; CoAP; Security Protocols.; Technology and Engineering;

    Sammanfattning : In this thesis, we presented comparisons with respect to Energy Consumption, bandwidth, the Constraint application protocol (CoAP) transaction time and throughput for four different security protocols. We simulated and implemented the Datagram Transport Layer Protection (DTLS) version 1.2, Transport Layer Protocol (TLS) version 1.2 & 1. LÄS MER

  7. 5. Classification of planning search space to accelerate solution finding

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

    Författare :Ayman Suliman; [2020]
    Nyckelord :;

    Sammanfattning : Machine Learning (ML) has been used to increase the performance of existing systems in various fields in the industry. This master thesis tackles the use of ML on data generated by the Planner and Scheduler (PLAS) system developed at Scania. LÄS MER