Sökning: "randomisation"

Visar resultat 1 - 5 av 11 uppsatser innehållade ordet randomisation.

  1. 1. Fuzz Testing for Quality Control in Systems with Complex Input Data

    Kandidat-uppsats, Linköpings universitet/Institutionen för datavetenskap

    Författare :Josefin Bodin; [2023]
    Nyckelord :fuzz testing; quality control; complex input; input validation; software testing; fuzzing;

    Sammanfattning : Fuzz testing is a testing technique used to generate a large amount of random or semi-random input data. This data is then fed to a target system which is then run with said data and monitored for anomalous behaviour. LÄS MER

  3. 2. Centralisation on Decentralised Online Social Networks

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

    Författare :Martin Ryberg Laude; Markus Brewitz; [2023]
    Nyckelord :Social media; centralised platforms; decentralised; platforms; Mastodon; onboarding flow; user tests; randomisation; centralisation; decentralisation;

    Sammanfattning : The rapid growth of centralised social media platforms such as Twitter and Facebook has raised concerns about privacy and the concentration of power held by the companies behind these services. In response, decentralised social media platforms have emerged as alternatives, forming federations of various instances without a single owner. LÄS MER

  4. 3. Swedish Farmers’ Acceptance of RCTs and Economic Experiments

    Master-uppsats, SLU/Dept. of Economics

    Författare :Leon Johannes Englberger; [2022]
    Nyckelord :Economics; agriculture; farmers’ opinion; agricultural policy; experimental economics; economic experiments; environmental policy; RCTs;

    Sammanfattning : A shift in the Common European Agriculture (CAP) towards agri-environmental payment schemes meant to incentivise the provision of environmental public goods calls for a diverse set of policy evaluation methods. Economic experiments such as RCTs can be efficient and cost-effective tools for improving and evaluating the effectiveness of these novel policies. 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. Designing for Replayability : Designing a game with a simple gameplay loop for the purpose of being replayable

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

    Författare :Nicolas Hammar; Jonathan Persson; [2022]
    Nyckelord :video games; game development; game design; replayability; replay value; synergy; meaningful choices;

    Sammanfattning : Replayability in games is important to many players as it increases the amount of play time they get out of a game for the price they paid, which is why it is interesting to know how replayability can be promoted in games with simple mechanics. Previous research has categorised what motivates players to play a game again, as aspects of replayability. LÄS MER