Sökning: "Heap"

Visar resultat 1 - 5 av 26 avhandlingar innehållade ordet Heap.

  1. 1. Living conditions in old age: Coexisting disadvantages across life domains

    Författare :Josephine Heap; Carin Lennartsson; Mats Thorslund; Peter Dellgran; Stockholms universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Old age; Living conditions; Welfare; Deprivation; Coexisting disadvantages; Inequality; Longitudinal analysis; Trends; Sweden; Social Work; socialt arbete;

    Sammanfattning : The aim of this thesis was to analyse coexisting disadvantages in the older Swedish population. Coexisting disadvantages are those that occur simultaneously in various life domains. LÄS MER

  3. 2. Impartial Games and Recursive Functions

    Författare :Urban Larsson; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Algorithmically undecidable; Beatty sequences; Blocking maneuver; Cellular automaton; Comply maneuver; Complementary sequences; Dictionary process; Dual game; Game complexity; Game convergence; Game reflexivity; Heap game; Impartial game; Invariant subtraction game; Move-size dynamic; Nim; P-equivalence; Rule 110; Splitting sequences; *-operator; Subtraction game; Take-away game; Turing complete; Wythoff Nim; Turing complete;

    Sammanfattning : Interest in 2-player impartial games often concerns the famous theory of Sprague-Grundy. In this thesis we study other aspects, bridging some gaps between combinatorial number theory, computer science and combinatorial games. LÄS MER

  4. 3. Efficient Implementation of Concurrent Programming Languages

    Författare :Erik Stenman; Simon Peyton Jones; Uppsala universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datalogi; Datavetenskap; Computer Science;

    Sammanfattning : Dissertation in Computer Science to be publicly examined in Häggsalen, Ångströmlaboratoriet, Uppsala University, on Friday, November 1, 2002 at 1:00 pm for the degree of doctor of philosophy. The examination will be conducted in English. LÄS MER

  5. 4. Garbage collection for reactive real-time systems

    Författare :Martin Kero; Roger Henriksson; Luleå tekniska universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Dependable Communication and Computation Systems; Kommunikations- och beräkningssystem;

    Sammanfattning : Predictable use of resources, such as processor time and memory, is a desirable property for virtually any computer system. In real-time computing, static predictability is of particular concern. LÄS MER

  7. 5. Types for Crash Preventionn

    Författare :Lars Pareto; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; reliability; dependability; concurrent programming; denotational semantics; real-time systems and embedded systems; data-flow; dynamic storage management; applicative functional programming languages ; type systems;

    Sammanfattning : This thesis seeks to strengthen the capabilities of static polymorphic type-checking (as known from typed lambda calculus and functional programming) to allow a larger class of programming errors to be caught at compile time: the goal is to not only prevent illegal uses of data, but to also errors that lead to busy-loops, deadlocks, stack-overflows and heap-overflows. The thesis exploits that, for recursive programs, many correctness properties (including freedom from errors leading to busy-loops, etc. LÄS MER