Sökning: "algorithmic form"

Visar resultat 1 - 5 av 29 avhandlingar innehållade orden algorithmic form.

  1. 1. Definitional program separation

    Författare :Göran Falkman; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; definitional programming; algorithmic form; algorithmic content; higher order programming; definitions; program separation;

    Sammanfattning : .... LÄS MER

  3. 2. Algorithmic Verification Techniques for Mobile Code

    Författare :Irem Aktug; Dilian Gurov; Mads Dam; Ulfar Erlingsson; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Verification; Mobile Code Security; Reference Monitoring; Maximal Models; Compositional Verification; Theoretical computer science; Teoretisk datalogi;

    Sammanfattning : Modern computing platforms strive to support mobile code without putting system security at stake. These platforms can be viewed as open systems, as the mobile code adds new components to the running system. Establishing that such platforms function correctly can  be divided into two steps. LÄS MER

  4. 3. Reconciling Form and Function through Generative Design

    Författare :Axel Nordin; Innovation; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Generative design; morphological repertoire; constraint handling; optimization; customization; industrial design; engineering design;

    Sammanfattning : The current form-giving activity in industrial design is characterized by explorations that depend on the individual capability to mentally manipulate a solution space from which to select and express the intended result. Industrial designers frequently rely on artistic experimentation, aesthetic inspiration, or design briefs. LÄS MER

  5. 4. Identification and tuning of algorithmic parameters in parallel matrix computations : Hessenberg reduction and tensor storage format conversion

    Författare :Mahmoud Eljammaly; Bo Kågström; Lars Karlsson; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES;

    Sammanfattning : This thesis considers two problems in numerical linear algebra and high performance computing (HPC): (i) the parallelization of a new blocked Hessenberg reduction algorithm using Parallel Cache Assignment (PCA) and the tunability of its algorithm parameters, and (ii) storing and manipulating dense tensors on shared memory HPC systems.The Hessenberg reduction appears in the Aggressive Early Deflation (AED) process for identifying converged eigenvalues in the distributed multishift QR algorithm (state-of-the-art algorithm for computing all eigenvalues for dense square matrices). LÄS MER

  7. 5. Shared Memory Objects as Synchronization Abstractions: Algorithmic Implementations and Concurrent Applications

    Författare :Ioannis Nikolakopoulos; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; concurrent data structures; parallelism; lock-free synchronization; data stream processing; iteration;

    Sammanfattning : Multicore and many-core architectures have penetrated the vast majority of computing systems, from high-end servers to low-energy embedded devices. From the hardware's perspective, performance scalability comes in the form of increasing numbers of cores. Nevertheless, fully utilizing this power is still an open research and engineering issue. LÄS MER