Blar i NTNU Open på forfatter "Hetland, Magnus Lie"

Viser treff 1-20 av 61

    • A Julia Implementation of the Differentiable Neural Computer 

      Rodahl, Sondre Johannes Elgvin (Master thesis, 2020)
      I differensierbar programmering-paradigmet modelleres programmer som parametriserte løsninger på et problem som deretter trenes med gradientbaserte optimeringsmetoder. DeepMinds Differentiable Neural Computer (DNC) er et ...

    • A puzzle-based storage system with diagonal movement 

      Halseide, Martin Amaral (Master thesis, 2022)
      Abstract will be available on 2025-02-01

    • A Specialized Question Answering System Using Natural Language: Developed Using the Quepy Framework 

      Heimark, Karl Johan V (Master thesis, 2013)
      For decades there has been done a lot of work on trying to make computers answernatural language questions. Current research still has a long way to go before accom-plishing this goal. In this thesis I have built a prototype ...

    • Air controller scheduling at Avinor 

      Skogen, Torgeir Woldstad (Master thesis, 2017)
      The air space in Norway is controller by Avinor. This work is done by air traffic controllers, who operate under strict rules regarding how this work is carried out. This has implications on how long they can work and how ...

    • Akustisk Simulering i 2D ved hjelp av CUDA 

      Havellen, Sondre Slåttedal (Master thesis, 2019)
      Denne oppgaven undersøker hvordan GPU kan brukes for å simulere akustikk i virtuelle rom. Denne oppgaven presenterer matematisk teori om akustikk, flere FDTD-metoder, samt implementering og evaluering av metodene. Videre ...

    • Are we ready to Rummage? - An evaluation of the Rummage library through a comparative performance analysis of metric indexing structures implemented in and outside of it and a framework for the implementation of metric indexing structures. 

      Trondrud, Odd Magnus (Master thesis, 2015)
      Julia implementations of the Bisector Tree, Generalized Hyperplane Tree and AESA metric indexing structures are presented -- stand-alone variants and using the Rummage.jl library. The presented interface for metric indexing ...

    • Bin packing problem with order constraints. 

      Lundanes, Petter Olsen (Master thesis, 2014)
      This paper presents an algorithm to solve a variant of the bin packing problem with additional constraints on the order of items. The performance of this algorithm is tested, both for optimal solutions and approximations ...

    • Clustering with Multi-Focal Clusters 

      Philipp, Andre (Master thesis, 2015)
      We present one and develop two heuristic algorithms for multi-focal clustering. The first algorithm is a local search algorithm based on the Partition Around Medoids (PAM) algorithm. The second algorithm is a modification ...

    • CMR: Concurrent Memory Reclamation 

      Thoresen, Martin Hafskjold (Master thesis, 2018)
      Concurrent memory reclamation is the problem of deciding whether a memory allocation is still in use or not in a concurrent system. This thesis presents a new memory management system called CMR for the Rust programming ...

    • Combining Deep Learning and Combinatorial Optimisation to Generate Four-Part Chorales 

      Kaspersen, Simen Kværneng (Master thesis, 2019)
      Denne masteroppgaven beskriver implementasjonen av en funksjonell prototype som består av et rekurrent neuralt nettverk og en branch-and-bound optimeringsalgoritme i konjunksjon for å generere musikk som tilretter seg ...

    • Combining Hyperband and Gaussian Process-based Bayesian Optimization 

      Iversen, Bjørn Magnus Valberg (Master thesis, 2020)
      Å identifisere gode hyperparametre for maskinlæringsmodeller er en viktig oppgave. Denne oppgaven er såpass viktig at den har inspirert et eget felt, nemlig hyperparameteroptimering. Det finnes mange hyperparameteroptime ...

    • Development of a General Purpose Gamification Framework 

      Vea, Eivind (Master thesis, 2016)
      This report describes the design and implementation of a general purpose gamification framework developed in JavaScript on the Metor platform. Gamification is described as the use of game elements in none-game contexts. ...

    • Discovery of approximate composite motifs in biological sequences 

      Valebjørg, Vetle Søraas (Master thesis, 2006)
      Mapping the regulatory system in living organisms is a great challenge, and many methods have been created during the last 15 years to solve this problem. The biological processes are however more flexible and complex than ...

    • Dividing Consignments: An Exploration of Different Methods 

      Seljeseth, Sabine (Master thesis, 2023)
      I denne masteren blir ulike metoder for å dele opp større, sammensatte ordre til mindre ordre som har plass på en enkelt pall undersøkt. Motivasjonen bak detter er å gi det norske logistikk- og robotikkselskapet Solwr mer ...

    • Empirical evaluation of metric indexing methods 

      Fevang, Rune; Fossaa, Arne Bergene (Master thesis, 2008)
      Metric indexing is a branch of search technology that is designed for search non-textual data. Examples of this includes image search (where the search query is an image), document search (finding documents that are roughly ...

    • Energy Efficient Computing on Multi-core Processors: Vectorization and Compression Techniques 

      Al Hasib, Abdullah (Doctoral theses at NTNU;2018:143, Doctoral thesis, 2018)
      Over the past few years, energy consumption has become the main limiting factor for computing in general. This has led CPU vendors to aggressively promote parallel computing using multiple cores without significantly ...

    • Engineering Efficient Similarity Search Methods 

      Naidan, Bilegsaikhan (Doctoral theses at NTNU;2017:84, Doctoral thesis, 2017)
      Similarity search has become one of the important parts of many applications including multimedia retrieval, pattern recognition and machine learning. In this problem, the main task is to retrieve most similar (closest) ...

    • Evaluation of the Iwata–Yokoi Algorithm 

      Hummel, Halvard (Master thesis, 2020)
      Gitt en urettet multigraf, G = (V, E), uten løkker, og en delmengde terminaler, T ⊆ V, kalles en sti mellom to distinkte terminaler, hvor alle interne noder i stien ikke er terminaler, en T-sti. Gitt denne definisjonen ...

    • Exploring Compression in Memcached 

      Eide, Håkon Karsten; Haug, Magnus (Master thesis, 2011)
      Implementation and performance evaluation of various compression schemes in the Memcached distributed memory caching system, through the LibMemcached library.

    • Exploring Matroids in Fair Allocation: Building the Matroids.jl Library 

      Aaberge Eide, Andreas (Master thesis, 2023)
      Denne oppgaven utforsker rollen matroider spiller innen rettferdig fordeling, med mål for øyet å utvikle Matroids.jl, et Julia-bibliotek som muliggjør empirisk analyse av algoritmer for rettferdig fordeling som bruker ...