Calculating Cumulative Operational Time Distributions of Repairable Computer Systems
IEEE Transactions on Computers - The MIT Press scientific computation series
On Evaluating the Cumulative Performance Distribution of Fault-Tolerant Computer Systems
IEEE Transactions on Computers
Numerical recipes in C (2nd ed.): the art of scientific computing
Numerical recipes in C (2nd ed.): the art of scientific computing
Performability Analysis: A New Algorithm
IEEE Transactions on Computers
Existence and stability of a discrete probability distribution by maximum entropy approach
Applied Mathematics and Computation
Evaluation of Reward Analysis Methods with MRMSolve 2.0
QEST '04 Proceedings of the The Quantitative Evaluation of Systems, First International Conference
Fluid analysis of energy consumption using rewards in massively parallel markov models
Proceedings of the 2nd ACM/SPEC International Conference on Performance engineering
Analysis of stochastic reaction networks with Markov reward models
Proceedings of the 9th International Conference on Computational Methods in Systems Biology
Fluid computation of passage-time distributions in large Markov models
Theoretical Computer Science
| Hi-index | 0.00 |
The problem of moments has been studied for more than a century. This paper discusses a practical issue related to the problem of moments namely the bounding of a distribution based on a given number of moments. The presented approach is unified in the sense that all measures of interests are provided as a quadratic expression of the same Hankel-matrix. Application examples indicate the importance of the presented approach.