Displaying similar documents to “Dynamic system evolution and Markov chain approximation.”

A mathematical framework for learning and adaption: (generalized) random systems with complete connections.

Ulrich Herkenrath, Radu Theodorescu (1981)

Trabajos de Estadística e Investigación Operativa

Similarity:

The aim of this paper is to show that the theory of (generalized) random systems with complete connection may serve as a mathematical framework for learning and adaption. Chapter 1 is of an introductory nature and gives a general description of the problems with which one is faced. In Chapter 2 the mathematical model and some results about it are explained. Chapter 3 deals with special learning and adaption models.

Fast simulation for road traffic network

Roberta Jungblut-Hessel, Brigitte Plateau, William J. Stewart, Bernard Ycart (2001)

RAIRO - Operations Research - Recherche Opérationnelle

Similarity:

In this paper we present a method to perform fast simulation of large markovian systems. This method is based on the use of three concepts: Markov chain uniformization, event-driven dynamics, and modularity. An application of urban traffic simulation is presented to illustrate the performance of our approach.

Estimates for perturbations of average Markov decision processes with a minimal state and upper bounded by stochastically ordered Markov chains

Raúl Montes-de-Oca, Francisco Salem-Silva (2005)

Kybernetika

Similarity:

This paper deals with Markov decision processes (MDPs) with real state space for which its minimum is attained, and that are upper bounded by (uncontrolled) stochastically ordered (SO) Markov chains. We consider MDPs with (possibly) unbounded costs, and to evaluate the quality of each policy, we use the objective function known as the average cost. For this objective function we consider two Markov control models and 1 . and 1 have the same components except for the transition laws....