Sökning: "information partition"
Visar resultat 11 - 15 av 78 avhandlingar innehållade orden information partition.
11. Perspectives on Probabilistic Graphical Models
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
12. Graph Partitioning and Planted Partitions
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
13. Fixed-Parameter Algorithms for Optimal Convex Partitions and Other Results
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
14. Essays on Epistemology and Evolutionary Game Theory
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
15. Techniques for Automatic Generation of Tests from Programs and Specifications
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