Sökning: "Peter A. Jonsson"

Visar resultat 1 - 5 av 30 avhandlingar innehållade orden Peter A. Jonsson.

  1. 1. Positive supercompilation for a higher-order call-by-value language

    Författare :Peter A. Jonsson; Luleå tekniska universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Dependable Communication and Computation Systems; Kommunikations- och beräkningssystem;

    Sammanfattning : Intermediate structures such as lists and higher-order functions are very common in most styles of functional programming. While allowing the programmer to write clear and concise programs, the creation and destruction of these structures impose a run time overhead which is not negligible. LÄS MER

  3. 2. Time- and size-efficient supercompilation

    Författare :Peter A. Jonsson; Taha Walid; Luleå tekniska universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Dependable Communication and Computation Systems; Kommunikations- och beräkningssystem;

    Sammanfattning : Intermediate structures such as lists and higher-order functions are very common in most styles of functional programming. While allowing the programmer to write clear and concise programs, the creation and destruction of these structures impose a run time overhead which is not negligible. LÄS MER

  4. 3. Combinatorial Considerations on Two Models from Statistical Mechanics

    Författare :Johan Thapper; Svante Linusson; Peter Jonsson; Jakob Jonsson; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; fully packed loop model; rhombus tilings; hard particle model; independence complex; discrete morse theory; Discrete mathematics; Diskret matematik;

    Sammanfattning : Interactions between combinatorics and statistical mechanics have provided many fruitful insights in both fields. A compelling example is Kuperberg’s solution to the alternating sign matrix conjecture, and its following generalisations. LÄS MER

  5. 4. Algorithms and Hardness Results for Some Valued CSPs

    Författare :Fredrik Kuivinen; Peter Jonsson; Peter Jeavons; Linköpings universitet; []
    Nyckelord :TECHNOLOGY; TEKNIKVETENSKAP;

    Sammanfattning : In the Constraint Satisfaction Problem (CSP) one is supposed to find an assignment to a set of variables so that a set of given constraints are satisfied. Many problems, both practical and theoretical, can be modelled as CSPs. LÄS MER

  7. 5. Design and implementation of a programmable, wideband sonar for sediment mapping

    Författare :Peter Jonsson; Teknisk geologi; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; centroid; programmable sonar; sediment mapping; underwater acoustics; hydroacoustics; echosounder;

    Sammanfattning : To be able to explore different signal types and processing techniques, apt for sediment mapping, programmable, fully digital profiling systems has been built and tested. The systema are designed to be deployed also at small water depths from small boats, without special handling equipment. LÄS MER