Sökning: "Implicit memory"

Visar resultat 21 - 25 av 40 avhandlingar innehållade orden Implicit memory.

  1. 21. Programming embedded real-time systems : implementation techniques for concurrent reactive objects

    Författare :Simon Aittamaa; Mikael Sjödin; Luleå tekniska universitet; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Inbyggda system; Embedded System;

    Sammanfattning : An embedded system is a computer system that is a part of a larger device with hardware and mechanical parts. Such a system often has limited resources (such as processing power, memory, and power) and it typically has to meet hard real-time requirements. LÄS MER

  3. 22. Graph dominators in logic synthesis and verification

    Författare :René Krenz; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; formal verification; logic synthesis; dominators; equivalence checking; decomposition; Computer science; Datavetenskap;

    Sammanfattning : This work focuses on the usage of dominators in circuit graphs in order to reduce the complexity of synthesis and verification tasks. One of the contributions of this thesis is a new algorithm for computing multiple-vertex dominators in circuit graphs. LÄS MER

  4. 23. Att uppmärksamma det väsentliga : Lärares ämnesdidaktiska förmågor ur ett interaktionskognitivt perspektiv

    Författare :Karin Stolpe; Lars Ove Dahlgren; Lars-Erik Björklund; Lars Mouwitz; Linköpings universitet; []
    Nyckelord :SOCIAL SCIENCES; SAMHÄLLSVETENSKAP;

    Sammanfattning : Den här avhandlingen syftar till att belysa lärares ämnesdidaktiska förmågor i naturvetenskap. Jag fokuserar på tre olika förmågor som är centrala för lärare, nämligen lärares professionella seende, deras automatiska agerande samt deras förmåga att berätta narrativ. LÄS MER

  5. 24. Practical Unification for Dependent Type Checking

    Författare :Víctor López Juan; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; unification; type checking; dependent types; Functional Programming;

    Sammanfattning : When using popular dependently-typed languages such as Agda, Idris or Coq to write a proof or a program, some function arguments can be omitted, both to decrease code size and to improve readability.  Type checking such a program involves inferring a combination of these implicit arguments that makes the program type-correct. LÄS MER

  7. 25. Algorithms and Representations for Personalised Information Access

    Författare :Rickard Cöster; Lars Asker; Haym Hirsh; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datavetenskap;

    Sammanfattning : Personalised information access systems use historical feedback data, such as implicit and explicit ratings for textual documents and other items, to better locate the right or relevant information for individual users.Three topics in personalised information access are addressed: learning from relevance feedback and document categorisation by the use of concept-based text representations, the need for scalable and accurate algorithms for collaborative filtering, and the integration of textual and collaborative information access. LÄS MER