Sökning: "branching"

Visar resultat 1 - 5 av 82 uppsatser innehållade ordet branching.

  1. 1. A type-driven approach for sensitivity checking with branching

    Master-uppsats, Göteborgs universitet/Institutionen för data- och informationsteknik

    Författare :Daniel Freiermuth; [2023-10-24]
    Nyckelord :Computer; science; computer science; thesis; differential privacy; type system; sensitivity; branching;

    Sammanfattning : Differential Privacy (DP) is a promising approach to allow privacy preserving statistics over large datasets of sensitive data. It works by adding random noise to the result of the analytics. Understanding the sensitivity of a query is key to add the right amount of noise capable of protecting privacy of individuals in the dataset. LÄS MER

  3. 2. Investigating the use of olfactory cues to re-direct African savannah elephant pathways. A potential conflict mitigation tool.

    Master-uppsats, Göteborgs universitet / Institutionen för biologi och miljövetenskap

    Författare :Vera Ruijs; [2023-06-30]
    Nyckelord :African savannah elephants – conflict mitigation – elephant pathways – human-elephant conflict – olfactory cues;

    Sammanfattning : Human-elephant conflict resulting from, for example crop raiding behaviour, poses a significant threat to the conservation of African savannah elephants (Loxodonta africana). These conflicts can lead to fatalities in both humans and elephants. LÄS MER

  4. 3. Branching Out with Mixtures: Phylogenetic Inference That’s Not Afraid of a Little Uncertainty

    Master-uppsats, KTH/Matematisk statistik

    Författare :Ricky Molén; [2023]
    Nyckelord :Phylogeny; Bayesian analysis; Markov chain Monte Carlo; Variational inference; Mixture of proposal distributions; Fylogeni; Bayesiansk analys; Markov Chain Monte Carlo; Variationsinferens; Mixturer av förslagsfördelningar;

    Sammanfattning : Phylogeny, the study of evolutionary relationships among species and other taxa, plays a crucial role in understanding the history of life. Bayesian analysis using Markov chain Monte Carlo (MCMC) is a widely used approach for inferring phylogenetic trees, but it suffers from slow convergence in higher dimensions and is slow to converge. LÄS MER

  5. 4. Constraining the Higgs width in Higgs production associated with a top quark pair

    Kandidat-uppsats, Lunds universitet/Fysiska institutionen; Lunds universitet/Teoretisk partikelfysik - Geonomgår omorganisation

    Författare :Benjamin Dahlén; [2023]
    Nyckelord :Higgs; width; cross section; on-shell; off-shell; invariant mass; Standard model; upper bound; Physics and Astronomy;

    Sammanfattning : In this thesis we study the width of the Higgs boson in the process pp → t ̄t 4l at LO using MadGraph5_aMC@NLO to generate the events. The contributions including the Higgs signal, continuum background and interference were considered in order to calculate the expected number of events in a broad range of four-lepton invariant masses. LÄS MER

  7. 5. Imitation Learning on Branching Strategies for Branch and Bound Problems

    Master-uppsats, KTH/Matematisk statistik

    Författare :Magnus Axén; [2023]
    Nyckelord :Graph Networks; Convolutions; MIP; Branch and Bound; Facility Location Problem; MDP; Imitation Learning; Graf nätverk; Faltning; Blandade heltaltsproblem; Branch and Bound; Facility Location Problem; Markov; Imitationsinlärning;

    Sammanfattning : A new branch of machine and deep learning models has evolved in constrained optimization, specifically in mixed integer programming problems (MIP). These models draw inspiration from earlier solver methods, primarily the heuristic, branch and bound. LÄS MER