Search for dissertations about: "deterministic graph"

Showing result 1 - 5 of 14 swedish dissertations containing the words deterministic graph.

  1. 1. Topics on Game Theory

    University dissertation from Chalmers University of Technology

    Author : Emilio Bergroth; Göteborgs universitet.; Gothenburg University.; [2011]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; zero-sum game; optimal strategy; random matrix; iterated prisoner s dilemma; spatial game; cooperation; deterministic graph; binomial random graph;

    Abstract : .... READ MORE

  2. 2. Constructing Algorithms for Constraint Satisfaction and Related Problems Methods and Applications

    University dissertation from Institutionen för datavetenskap

    Author : Ola Angelsmark; Peter Jonsson; Brahim Hnich; [2005]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; constraint satisfaction; CSP; graph problems; algorithm construction; computational complexity; microstructures; graph colouring; decision problems; optimisation problems; quantum computing; molecular computing; TECHNOLOGY Information technology Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap;

    Abstract : 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. READ MORE

  3. 3. Complexity and expressiveness for formal structures in Natural Language Processing

    University dissertation from Umeå : Umeå Universitet

    Author : Petter Ericson; Umeå universitet.; [2017]
    Keywords : 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;

    Abstract : 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. READ MORE

  4. 4. Optimal Decisions with Limited Information

    University dissertation from Department of Automatic Control, Lund Institute of Technology, Lund University

    Author : Ather Gattami; [2007]
    Keywords : 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;

    Abstract : 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. READ MORE

  5. 5. On Approximating Asymmetric TSP and Related Problems

    University dissertation from Stockholm : KTH

    Author : Anna Palbom; KTH.; [2006]
    Keywords : NATURVETENSKAP; NATURAL SCIENCES; Komplexity theory; algorithms; approxiamtion; TECHNOLOGY Information technology Computer science Computer science; TEKNIKVETENSKAP Informationsteknik Datavetenskap Datalogi;

    Abstract : In this thesis we study problems related to approximation of asymmetric TSP. First we give worst case examples for the famous algorithm due to Frieze, Gabiati and Maffioli for asymmetric TSP with triangle inequality. Some steps in the algorithm consist of arbitrary choices. To prove lower bounds, these choices need to be specified. READ MORE