Efficient implementations of the randomization method with control of the relative error
From MaRDI portal
Publication:2485165
DOI10.1016/j.cor.2003.09.014zbMath1073.60071MaRDI QIDQ2485165
Víctor Suñé, Juan Antonio Carrasco
Publication date: 3 August 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/20936
60J22: Computational methods in Markov chains
60J27: Continuous-time Markov processes on discrete state spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Numerical transient analysis of Markov models
- Computation of bounds for transient measures of large rewarded Markov models using regenerative randomization.
- Upper bounds on Poisson tail probabilities
- The Randomization Technique as a Modeling Tool and Solution Procedure for Transient Markov Processes
- Randomization Procedures in the Computation of Cumulative-Time Distributions over Discrete State Markov Processes
- Adaptive uniformization
- Computationally efficient and numerically stable reliability bounds for repairable fault-tolerant systems
- Availability analysis of repairable computer systems and stationarity detection
- Computation of the Chi-Square and Poisson Distribution
- Transient analysis of cumulative measures of markov model behavior