Sökning: "programming by behaviors"

Visar resultat 1 - 5 av 11 uppsatser innehållade orden programming by behaviors.

  1. 1. ”VAD JAG ÄN GÅR IGENOM I LIVET SÅ SKICKAR JAG I ALLA FALL INTE IN EN ANMÄLAN FÖR ATT VARA MED I PARADISE HOTEL” En kvalitativ studie om unga kvinnors konsumtion av dokusåpor.

    Kandidat-uppsats, Göteborgs universitet/Institutionen för journalistik, medier och kommunikation

    Författare :Ylva Bergström; Liv Bolin; [2023-10-03]
    Nyckelord :Dokusåpa; Uses and Gratification; Social Comparision Theory; unga kvinnor; kvalitativ; parintervjuer.;

    Sammanfattning : Executive summary The purpose of this bachelor thesis is to delve into the world of docusoaps and explore the fascinating phenomenon of why people watch them. By focusing on the Uses and Gratification framework and the Social Comparison Theory we aim to shed light on the underlying motivations, needs and psychological aspects that attract viewers to this unique genre of television programming. LÄS MER

  3. 2. Extending applicability of symbolic execution to uncover possible shared memory transactions in GPU programs

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

    Författare :Jonathan Hjort; [2022]
    Nyckelord :;

    Sammanfattning : General-purpose computing on the graphics processing unit has become popular since the cost-to-power ratio is lower for GPUs (compared to CPUs) and the programmability of the GPU has increased. CUDA is an extension of the C/C++ programming languages which enables software developers to more easily make use of the computational power of the GPUs. LÄS MER

  4. 3. Estimating Believed Knowledge of Portfolio Agents Using Inverse Optimization

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

    Författare :Gustaf Zachrisson; Oscar Wink; [2022]
    Nyckelord :;

    Sammanfattning : In this report, we demonstrate the utility of inverse optimization in convex programming by applying it on estimating financial market beliefs and behaviors of portfolio investors. The inversion of the optimization  utilized the Karush–Kuhn–Tucker optimality conditions specified for the current situation. LÄS MER

  5. 4. Extracting scalable program models for TLA model checking

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

    Författare :Anders Ågren Thuné; Theo Puranen Åhfeldt; [2020]
    Nyckelord :;

    Sammanfattning : Program verification has long been of interest to researchers and practitioners for its role in asserting reliability in critical systems. Many such systems feature reactive behavior, where temporal properties are of interest. Consequently, a number of systems and program verification tools for dealing with temporal logic have been developed. LÄS MER

  7. 5. A Deep Reinforcement Learning Framework where Agents Learn a Basic form of Social Movement

    Uppsats för yrkesexamina på avancerad nivå, Uppsala universitet/Avdelningen för visuell information och interaktion

    Författare :Erik Ekstedt; [2018]
    Nyckelord :machine learning; deep learning; Pepper; neural network; reinforcement learning;

    Sammanfattning : For social robots to move and behave appropriately in dynamic and complex social contexts they need to be flexible in their movement behaviors. The natural complexity of social interaction makes this a difficult property to encode programmatically. LÄS MER