Sökning: "Memoization"

Hittade 3 uppsatser innehållade ordet Memoization.

  1. 1. Applying Memoization as an Approximate Computing Method for Transiently Powered Systems

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

    Författare :Dragos-Stefan Perju; [2019]
    Nyckelord :memoization; approximate computing; intermittent computing; energy harvesting; embedded systems; internet of things; memoization; approximativ databehandling; intermittent databehandling; energi skördar; inbäddade system; sakernas internet;

    Sammanfattning : Internet of Things (IoT) is becoming a more and more prevailing technology, as it not only makes the routine of our life easier, but it also helps industry and enteprise become more efficient. The high potential of IoT can also help support our own population on Earth, through precision agriculture, smart transportation, smart city and so on. LÄS MER

  3. 2. Memory Optimization in the JastAdd Metacompiler

    Uppsats för yrkesexamina på avancerad nivå, Lunds universitet/Institutionen för datavetenskap

    Författare :Axel Mårtensson; [2017]
    Nyckelord :Reference Attribute Grammars; Memory Optimization; Memoization; Java; Technology and Engineering;

    Sammanfattning : JastAdd is a tool for generating programming language compilers. These compilers generally use more memory than other compilers for the same language. In this thesis we have categorized the memory use of two JastAdd-generated compilers, to identify opportunities to reduce their memory use. LÄS MER

  4. 3. A Comparison Between Packrat Parsing and Conventional Shift-Reduce Parsing on Real-World Grammars and Inputs

    Uppsats för yrkesexamina på avancerad nivå, Uppsala universitet/Institutionen för informationsteknologi

    Författare :Daniel Flodin; [2014]
    Nyckelord :;

    Sammanfattning : Packrat parsing is a top-down, recursive descent parsing technique that uses backtracking and has a guaranteed linear parse time. Conventional backtracking parsers suffer from exponential parse times in the worst case due to re-evaluating redundant results. This is avoided in packrat parsers with the use of memoization. LÄS MER