Sökning: "information partition"

Visar resultat 11 - 15 av 78 avhandlingar innehållade orden information partition.

  1. 11. Perspectives on Probabilistic Graphical Models

    Författare :Dong Liu; Ragnar Thobaben; Harri Lähdesmäki; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; NATURVETENSKAP; NATURAL SCIENCES; Bayesian methods; graphical models; inference; learning; statistics; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : Probabilistic graphical models provide a natural framework for the representation of complex systems and offer straightforward abstraction for the interactions within the systems. Reasoning with help of probabilistic graphical models allows us to answer inference queries with uncertainty following the framework of probability theory. LÄS MER

  2. 12. Graph Partitioning and Planted Partitions

    Författare :Mikael Onsjö; Chalmers tekniska högskola; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; planted partition; graph bisection; algorithms; graphs; graph partitioning; clustering;

    Sammanfattning : Graph partitioning is the problem of splitting a graph into two or morepartitions of fixed sizes while minimizing the number of edges that are “cut”.This is an important problem with a wide range of applications in fields suchas VLSI design, parallel processing, bioinformatics, data mining etc. LÄS MER

  3. 13. 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

  4. 14. Essays on Epistemology and Evolutionary Game Theory

    Författare :Elias Tsakas; Göteborgs universitet; []
    Nyckelord :SAMHÄLLSVETENSKAP; SOCIAL SCIENCES; Common knowledge; communication; consensus; betting; primitive propositions; negative introspection; information partition; projection; learning.;

    Sammanfattning : This thesis has two parts, one consisting of three independent papers in epistemology (Chapters 1-3) and another one consisting of a single paper in evolutionary game theory (Chapter 4): (1) “Knowing who speaks when: A note on communication, common knowledge and consensus” (together with Mark Voorneveld) We study a model of pairwise communication in a finite population of Bayesian agents. We show that, if the individuals update only according to the signal they actually hear, and they do not take into account all the hypothetical signals they could have received, a consensus is not necessarily reached. LÄS MER

  5. 15. Techniques for Automatic Generation of Tests from Programs and Specifications

    Författare :Jon Edvardsson; Mariam Kamkar; Maud Göthe-Lundgren; Jeff Offutt; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; testing; automatic test data generation; partition testing; constraint solving; program coverage; specification coverage; Software engineering; Programvaruteknik;

    Sammanfattning : Software testing is complex and time consuming. One way to reduce the effort associated with testing is to generate test data automatically. This thesis is divided into three parts. In the first part a mixed-integer constraint solver developed by Gupta et. LÄS MER