Sökning: "fixed-point systems"

Visar resultat 1 - 5 av 32 avhandlingar innehållade orden fixed-point systems.

  1. 1. Residue fixed point index and wildly ramified power series

    Författare :Jonas Nordqvist; Karl-Olof Lindahl; Robert Laurent Benedetto; Linnéuniversitetet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; wildly ramified power series; residue fixed point index; formal invariant; iterative residue; ramification numbers; non-archimedean; discrete dynamical systems; arithmetic dynamics; periodic points; Nottingham group; Mathematics; Matematik;

    Sammanfattning : This thesis concerns discrete dynamical systems. These are systems where the dynamics is modeled by iterated functions. There are several applications of discrete dynamical system e.g. LÄS MER

  3. 2. Reinforcement Learning and Dynamical Systems

    Författare :Björn Lindenberg; Karl-Olof Lindahl; Marc G. Bellemare; Linnéuniversitetet; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; artificial intelligence; distributional reinforcement learning; Markov decision processes; Bellman operators; deep learning; multi-armed bandits; Bayesian bandits; conjugate priors; Thompson sampling; linear finite dynamical systems; cycle orbits; fixed-point systems; Mathematics; Matematik; Computer Science; Datavetenskap;

    Sammanfattning : This thesis concerns reinforcement learning and dynamical systems in finite discrete problem domains. Artificial intelligence studies through reinforcement learning involves developing models and algorithms for scenarios when there is an agent that is interacting with an environment. LÄS MER

  4. 3. Object-Oriented Declarative Program Analysis

    Författare :Eva Magnusson; Institutionen för datavetenskap; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; numerisk analys; Datalogi; control; systems; numerical analysis; Declarative object-oriented programming; attribute grammars; fixed-point computations; Computer science; cross references; system; kontroll;

    Sammanfattning : This thesis deals with techniques for raising the programming level for a particular kind of computations, namely those on abstract syntax trees. Such computations are central in many program analysis tools, such as compilers, smart language-sensitive editors, and static analysis tools. LÄS MER

  5. 4. On interference suppression techniques for communication systems

    Författare :Hongxia Zhao; Chalmers tekniska högskola; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; CDMA; QPSK; fixed-point implementation; DQPSK; rapid single flux quantum RSFQ ; MUD; unequal BER; fiber-optic communications; unequal SER; ISI;

    Sammanfattning : The work presented in this thesis concerns interferencesuppression techniques in two different communication systems.In the first part we study fiber-optic systems with practical non-ideal transmitters and receivers, which give rise to intersymbol interference (ISI). LÄS MER

  7. 5. Urban Travel Time Estimation from Sparse GPS Data : An Efficient and Scalable Approach

    Författare :Mahmood Rahmani; Harilaos Koutsopoulos; Nikolas Geroliminis; KTH; []
    Nyckelord :TEKNIK OCH TEKNOLOGIER; ENGINEERING AND TECHNOLOGY; map-matching; path inference; sparse GPS probes; floating car data; arterial; urban area; digital road network; iterative travel time estimation; fixed point problem; Stockholm; taxi; Transportvetenskap; Transport Science;

    Sammanfattning : The use of GPS probes in traffic management is growing rapidly as the required data collection infrastructure is increasingly in place, with significant number of mobile sensors moving around covering expansive areas of the road network. Many travelers carry with them at least one device with a built-in GPS receiver. LÄS MER