Sökning: "deterministic graph"

Visar resultat 1 - 5 av 19 avhandlingar innehållade orden deterministic graph.

  1. 1. Topics on Game Theory

    Författare :Emilio Bergroth; Göteborgs universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; zero-sum game; optimal strategy; random matrix; iterated prisoner s dilemma; spatial game; cooperation; deterministic graph; binomial random graph; optimal strategy;

    Sammanfattning : .... LÄS MER

  3. 2. Random Graph and Growth Models

    Författare :Sebastian Rosengren; Maria Deijfen; Pieter Trapman; Tatyana Turova; Stockholms universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Mathematical Statistics; matematisk statistik;

    Sammanfattning : Random graphs is a well-studied field of probability theory, and have proven very useful in a range of applications — modeling social networks, epidemics, and structures on the Internet to name a few. However, most random graphs are static in the sense that the network structure does not change over time. LÄS MER

  4. 3. Constructing Algorithms for Constraint Satisfaction and Related Problems : Methods and Applications

    Författare :Ola Angelsmark; Peter Jonsson; Brahim Hnich; Linköpings universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; constraint satisfaction; CSP; graph problems; algorithm construction; computational complexity; microstructures; graph colouring; decision problems; optimisation problems; quantum computing; molecular computing; Computer science; Datavetenskap;

    Sammanfattning : In this thesis, we will discuss the construction of algorithms for solving Constraint Satisfaction Problems (CSPs), and describe two new ways of approaching them. Both approaches are based on the idea that it is sometimes faster to solve a large number of restricted problems than a single, large, problem. LÄS MER

  5. 4. Complexity and expressiveness for formal structures in Natural Language Processing

    Författare :Petter Ericson; Henrik Björklund; Frank Drewes; Umeå universitet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; graph grammars; formal languages; natural language processing; parameterized complexity; abstract meaning representation; tree automata; deterministic tree-walking transducers; mildly context-sensitive languages; hyperedge replacement; tree adjoining languages; minimally adequate teacher;

    Sammanfattning : The formalized and algorithmic study of human language within the field of Natural Language Processing (NLP) has motivated much theoretical work in the related field of formal languages, in particular the subfields of grammar and automata theory. Motivated and informed by NLP, the papers in this thesis explore the connections between expressibility – that is, the ability for a formal system to define complex sets of objects – and algorithmic complexity – that is, the varying amount of effort required to analyse and utilise such systems. LÄS MER

  7. 5. Optimal Decisions with Limited Information

    Författare :Ather Gattami; Institutionen för reglerteknik; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; systems; numerical analysis; Computer science; Convex Optimization; Graph Theory; Team Decision Theory; Game Theory; control; Datalogi; numerisk analys; system; kontroll; Automation; robotics; control engineering; Automatiska system; robotteknik; reglerteknik;

    Sammanfattning : This thesis considers static and dynamic team decision problems in both stochastic and deterministic settings. The team problem is a cooperative game, where a number of players make up a team that tries to optimize a given cost induced by the uncertainty of nature. LÄS MER