Consider a communications network consisting of mobiles, some of which can serve as a receiver and/or transmitter in a multihop path. There are random external...
brown univ providence ri div of applied mathematics, 2005
We consider a communications network consisting of many mobiles. There are random external data processes arriving at some of the mobiles, each destined for a...
brown univ providence ri div of applied mathematics, 2005
The Markov chain approximation numerical methods are widely used to compute optimal value functions and controls for stochastic as well as deterministic...
brown univ providence ri div of applied mathematics, 2005
The Markov chain approximation method is a widely used, and efficient family of methods for the numerical solution a large part of stochastic control problems...
Consider the problem of value iteration for solving Markov stochastic games. One simply iterates backwards, via a Jacobi-like procedure. The convergence of the...
brown univ providence ri dept of mathematics, 2004
We are concerned with the scheduling decisions (allocation of transmitter time, bandwidth and power) for multi-access mobile communications for data...
brown univ providence ri lefschetz center for dynamical systems, 2001
The Markov chain approximation method is a widely used, relatively easy to use, and efficient family of methods for the bulk of stochastic control problems in...
centre national de la recherche scientifique at inria rocquencourt (france), 2004
We study heavy traffic asymptotics of many Additive Increase Multiplicative Decrease (AIMD) connections sharing a common router in the presence of other...
Publication gouvernementale
Filtrer vos résultats
Opération réussie
L’élément a été sauvegardé.
Opération réussie
Cet élément a été retiré.
Erreur
Vous avez dépassé le nombre maximal de 100 résultats sauvegardés.
Erreur
Impossible de sauvegarder l’élément. Veuillez réessayer. Si le problème persiste, il pourrait y avoir un problème avec l’élément.
Erreur
Impossible de supprimer l’article demandé. Veuillez réessayer plus tard.