Generating Markov-Chain Transitions Quickly: I
From MaRDI portal
Publication:4029055
DOI10.1287/ijoc.2.2.126zbMath0760.60094MaRDI QIDQ4029055
Publication date: 1 April 1993
Published in: ORSA Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/ijoc.2.2.126
60K25: Queueing theory (aspects of probability theory)
60J10: Markov chains (discrete-time Markov processes on discrete state spaces)
60K30: Applications of queueing theory (congestion, allocation, storage, traffic, etc.)
Related Items
Maintaining discrete probability distributions optimally, Unnamed Item, Massively parallel SIMD simulation of Markovian DEDS: Event and time synchronous methods, Variance reduction algorithms for parallel replicated simulation of uniformized Markov chains