Sökning: "Datalogi"

Visar resultat 1 - 5 av 1593 avhandlingar innehållade ordet Datalogi.

  1. 1. Neural control of locomotion in biological and robotic systems

    Författare :Tom Wadden; Holk Cruse; Stockholms universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datalogi; datalogi; Computer Science;

    Sammanfattning : .... LÄS MER

  2. 2. Infinite Structures in Timed Systems

    Författare :Pavel Krcal; Wang Yi; Joel Ouaknine; Uppsala universitet; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Theoretical computer science; Teoretisk datalogi; Datalogi; Computing Science;

    Sammanfattning : Real time systems distinguish themselves by explicitly stating timing constraints in the system specification. This requires specific methods and tools in system design to ensure such constraints. We focus on one of the methods applied in the validation phase, namely formal verification. LÄS MER

  3. 3. Conditional Inapproximability and Limited Independence

    Författare :Per Austrin; Johan Håstad; Ryan O'Donnell; KTH; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Computer science; Datalogi;

    Sammanfattning : Understanding the theoretical limitations of efficient computation is one of the most fundamental open problems of modern mathematics. This thesis studies the approximability of intractable optimization problems. In particular, we study so-called Max CSP problems. LÄS MER

  4. 4. Social Networks and Privacy

    Författare :Oleksandr Bodriagov; Sonja Buchegger; Melek Ӧnen; KTH; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; social networks; privacy; decentralized; encryption-based access control; Computer Science; Datalogi;

    Sammanfattning : Centralized online social networks pose a threat to their users’ privacy as social network providers have unlimited access to users’ data. Decentralized social networks address this problem by getting rid of the provider and giving control to the users themselves, meaning that only the end-users themselves should be able to control access of other parties to their data. LÄS MER

  5. 5. Lower Bounds and Trade-offs in Proof Complexity

    Författare :Susanna F. de Rezende; Jakob Nordström; Amit Chakrabarti; KTH; []
    Nyckelord :NATURAL SCIENCES; NATURVETENSKAP; NATURVETENSKAP; NATURAL SCIENCES; Proof complexity; trade-offs; lower bounds; size; length; space; Datalogi; Computer Science;

    Sammanfattning : Propositional proof complexity is a field in theoretical computer science that analyses the resources needed to prove statements. In this thesis, we are concerned about the length of proofs and trade-offs between different resources, such as length and space. LÄS MER