Sökning: "Patrik Schwermer"

Hittade 2 uppsatser innehållade orden Patrik Schwermer.

1. 1. Performance Evaluation of Kotlin and Java on Android Runtime

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

   Författare :Patrik Schwermer; [2018]
   Nyckelord :Java; Kotlin; Android; Android Runtime; ART; CLBG; Computer Language Benchmarks Game; Runtime; Performance; Runtime; Memory consumption; Garbage collection; Boxing of primitives; Java; Kotlin; Android; Android Runtime; ART; CLBG; Computer Language Benchmarks Game; Prestanda; Körtid; Minnesanvändning; Garbage collection; Boxing av primitiver;

   Sammanfattning : This study evaluates the performance of Kotlin and Java on Android Runtime using four benchmarks from the Computer Language Benchmarks Game suite, for which a total of 12 benchmark implementations are studied. The metrics used to evaluate the performance includes runtime, memory consumption, garbage collection, boxing of primitives as well as bytecode n-grams. LÄS MER

3. 2. A comparative study of regularised SVD and item-based kNN for movie recommender systems

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

   Författare :Veronica Randleff; Patrik Schwermer; [2016]
   Nyckelord :;

   Sammanfattning : This thesis compares the performance of two algorithms for rating predictions in movie recommender systems. The two algorithms examined, regularised singular value decomposition (RegSVD) and item-based k-Nearest Neighbour (item-based kNN), are compared on 9 different datasets. LÄS MER