Sökning: "Approximate number system"

Visar resultat 1 - 5 av 61 avhandlingar innehållade orden Approximate number system.

  1. 1. “Count on me!” : Mathematical development, developmental dyscalculia and computer-based intervention

    Författare :Linda Olsson; Ulf Träff; Joakim Samuelsson; Lisa Thorell; Linköpings universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; mathematical development; symbolic number processing; Approximate number system; developmental dyscalculia; computer-based intervention; matematisk utveckling; symboliskt nummerprocessande; Approximativa nummersystemet; dyskalkyli; datorbaserad intervention;

    Sammanfattning : A “sense” of number can be found across species, yet only humans supplement it with exact and symbolic number, such as number words and digits. However, what abilities leads to successful or unsuccessful arithmetic proficiency is still debated. LÄS MER

  3. 2. Reducing Memory Traffic with Approximate Compression

    Författare :Albin Eldstål-Ahrens; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Memory Compression; Memory Systems; Compression; Computer Architecture; Lossy Compression; Approximate Computing;

    Sammanfattning : Memory bandwidth is a critical resource in modern systems and has an increasing demand. The large number of on-chip cores and specialized accelerators improves the potential processing throughput but also calls for higher data rates. In addition, new emerging data-intensive applications further increase memory traffic. LÄS MER

  4. 3. Fixed-Parameter Algorithms for Optimal Convex Partitions and Other Results

    Författare :Magdalene Grantson Borgelt; Data Vetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; control; Datalogi; numerical analysis; Convex Partition; Computer science; Triangulation; kontroll; system; numerisk analys; systems; Fixed-Parameter Algorithm; Spanning Tree;

    Sammanfattning : In this thesis I study two-dimensional geometric optimization problems for which it is difficult to find efficient, exact, deterministic algorithms. All known solutions to these problems require time that is exponential in the total size of the input. LÄS MER

  5. 4. Constructing Evolutionary Trees - Algorithms and Complexity

    Författare :Anna Östlin; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Maximum homeomorphic subtrees; Consensus trees; Experiment model; Evolutionary trees; Complexity; Computational biology; Algorithms; Data structures; numerical analysis; systems; control; Datalogi; numerisk analys; system; kontroll; Biology; Biologi;

    Sammanfattning : In this thesis three general problems concerning construction of evolutionary trees are considered. Algorithms for the problems are presented and the complexity of the problems is investigated. The thesis consists of three corresponding parts. The first part is devoted to the problem of constructing evolutionary trees in the experiment model. LÄS MER

  7. 5. Relaying for Industrial Wireless Networks

    Författare :Svetlana Girs; Fredrik Brännström; Mälardalens högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer Science; datavetenskap;

    Sammanfattning : The interest in wireless technology for industrial applications has increased dramatically over the last few years. Wireless communication can reduce cost and complexity, enable mobility and provide much higher flexibility than its wired counterparts. LÄS MER