Sökning: "stochastic computation"

Visar resultat 1 - 5 av 27 uppsatser innehållade orden stochastic computation.

1. 1. Simuleringsdriven inferens av stokastiska dynamiska system

   Kandidat-uppsats, Göteborgs universitet/Institutionen för matematiska vetenskaper

   Författare :Alfred Andersson; Vilgot Jansson; Noah Trädgårdh; Jacob Welander; Victor Wellsmo; [2023-11-28]
   Nyckelord :;

   Sammanfattning : Stokastiska modeller, som ger tillförlitlig och användbar information om ett systems beteende, består ofta av stokastiska differentialekvationer (SDE) vars likelihoodfunktion inte är analytiskt tillgänglig. Mer traditionella Markov Chain Monte Carlo-metoder (MCMC) samt relativt nyligen utvecklade likelihood-fria Approximate Bayesian Computation-metoder (ABC) utgör populära angrepssätt för att utföra inferens på dessa typer av problem. LÄS MER

3. 2. Simulated molecular adder circuits on a surface of DNA : Studying the scalability of surface chemical reaction network digital logic circuits

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

   Författare :Jakob Arvidsson; [2023]
   Nyckelord :Surface chemical reaction networks; Molecular computing; DNA computing; Circuit simulation; Adders; Ytbundna kemiska reaktionsnätverk; Molekylär beräkning; DNA-beräkning; Kretssimulering; Additionskretsar;

   Sammanfattning : The behavior of the Deoxyribonucleic Acid (DNA) molecule can be exploited to perform useful computation. It can also be ”programmed” using the language of Chemical Reaction Networks (CRNs). One specialized CRN construct is the Surface Chemical Reaction Network (SCRN). LÄS MER

4. 3. Parameter Inference for Stochastic Models of Gene Expression in Eukaryotic Cells

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

   Författare :Ansar Siddiqui; [2023]
   Nyckelord :;

   Sammanfattning : Simulation models are often used to study a system or phenomenon. However, before a simulation model can be used, its parameter needs to be fit to mimic observed data. This is called the parameter inference problem. LÄS MER

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

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