Sökning: "graph theory"

Visar resultat 1 - 5 av 106 avhandlingar innehållade orden graph theory.

  1. 1. Optimal input design for nonlinear dynamical systems a graph-theory approach

    Detta är en avhandling från Stockholm, Sweden : KTH Royal Institute of Technology

    Författare :Patricio E. Valenzuela Pacheco; KTH.; [2014]
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; Input design; Markov chains; system identification; Electrical Engineering; Elektro- och systemteknik;

    Sammanfattning : Optimal input design concerns the design of an input sequence to maximize the information retrieved from an experiment. The design of the input sequence is performed by optimizing a cost function related to the intended model application. Several approaches to input design have been proposed, with results mainly on linear models. LÄS MER

  2. 2. Advances in Functional Decomposition: Theory and Applications

    Detta är en avhandling från Stockholm : KTH

    Författare :Andrés Martinelli; KTH.; SICS.; [2006]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; TECHNOLOGY Information technology Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap; computer science; electronic system design; Boolean decomposition; binary decision diagram; logic synthesis; graph algorithm;

    Sammanfattning : Functional decomposition aims at finding efficient representations for Boolean functions. It is used in many applications, including multi-level logic synthesis, formal verification, and testing. This dissertation presents novel heuristic algorithms for functional decomposition. LÄS MER

  3. 3. Topics on Game Theory

    Detta är en avhandling från Chalmers University of Technology

    Författare :Emilio Bergroth; Chalmers tekniska högskola Göteborgs universitet.; Chalmers University of Technology University of Gothenburg.; Göteborgs universitet.; Gothenburg University.; [2011]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Övrig matematik; Other mathematics; zero-sum game; optimal strategy; random matrix; iterated prisoner s dilemma; spatial game; cooperation; deterministic graph; binomial random graph;

    Sammanfattning : .... LÄS MER

  4. 4. Discrete Methods used in Graph Theory and Linear Programming

    Detta är en avhandling från Centre for Mathematical Sciences, Lund University

    Författare :Olof Barr; Lunds universitet.; Lund University.; [2007]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematics; Perceptron Algorithm; Graph Theory; Linear Programming; Matematik;

    Sammanfattning : The content of the thesis is divided into two parts; graph theory and linear programming. The main results in the first part concerns extremal graph theory. Here we want to determine the number of edges in a graph needed to ensure the existence of certain local structures. LÄS MER

  5. 5. Random geometric graphs and their applications in neuronal modelling

    Detta är en avhandling från Lund University, Faculty of Science, Centre for Mathematical Sciences

    Författare :Fioralba Ajazi; Lunds universitet.; Lund University.; [2018-09]
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; NATURVETENSKAP; NATURAL SCIENCES; random graph; Neural Network; Probability; Inhomogeneous random graph; random distance graph; random grown networks;

    Sammanfattning : Random graph theory is an important tool to study different problems arising from real world.In this thesis we study how to model connections between neurons (nodes) and synaptic con-nections (edges) in the brain using inhomogeneous random distance graph models. LÄS MER