Sökning: "SCALA"

Visar resultat 21 - 25 av 41 uppsatser innehållade ordet SCALA.

  1. 21. Record Types in Scala: Design and Evaluation

    Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Olof Karlsson; [2017]
    Nyckelord :Records; Types; Scala; Programming Languages;

    Sammanfattning : A record type is a data type consisting of a collection of named fields that combines the flexibility of associative arrays in some dynamically typed languages with the safety guarantees and possible runtime performance of static typing. The structural typing of records is especially suitable for handling semi-structured data such as JSON and XML making efficient records an attractive choice for high-performance computing and large- scale data analytics. LÄS MER

  3. 22. Immutability: An Empirical Study in Scala

    Master-uppsats, KTH/Skolan för datavetenskap och kommunikation (CSC)

    Författare :Ludvig Axelsson; [2017]
    Nyckelord :immutability; empirical study; static analysis;

    Sammanfattning : Utilizing immutability is considered to have many desired benefits when it comes to software development and reasoning about programs. It is also one of the core principles of functional programming, and many programming languages have support for specifying immutability. LÄS MER

  4. 23. Prissättningsanalys av annonser på internet : En analys av variabler som påverkar slutpriset

    Kandidat-uppsats, KTH/Matematisk statistik

    Författare :Gustaf Erlandsson; Christofer Tärnel; [2016]
    Nyckelord :;

    Sammanfattning : Den här rapporten undersöker vilka faktorer som påverkar prissättningen av annonser på internet. För att komma fram till ett resultat användes statistisk analys på drygt 70000 datapunkter som erhölls av företaget Wiget Media. LÄS MER

  5. 24. Benchmarking Parallelism and Concurrency in the Encore Programming Language

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

    Författare :Mikael Östlund; [2016]
    Nyckelord :;

    Sammanfattning : Due to the limit in speedup of clock speed, most modern computers now sport multicore chips to provide computing power. Currently, programming language support for such machines often consists of extensions to languages that were originally designed to be sequential. New programming models and languages are needed that are parallel by design. LÄS MER

  7. 25. Distributed balanced edge-cut partitioning of large graphs having weighted vertices

    Master-uppsats, KTH/Skolan för informations- och kommunikationsteknik (ICT)

    Författare :Johan Elander Aman; [2015]
    Nyckelord :;

    Sammanfattning : Large scale graphs are sometimes too big to store and process on a single machine. Instead, these graphs have to be divided into smaller parts and distributed over several machines, while minimizing the dependency between the different parts. This is known as the graph partitioning problem, which has been shown to be NP-complete. LÄS MER