Results 271 to 280 of about 667,394 (343)
Some of the next articles are maybe not open access.
An exponential semi-markov process, with applications to queueing theory.
Stochastic Models, 1985Guy Latouche
exaly +2 more sources
Optimal Bayesian early fault detection for CNC equipment using hidden semi-Markov process
Mechanical systems and signal processing, 2019The goal of a computer numerically controlled (CNC) equipment is to guarantee high specified performance and to maintain it effectively over its life cycle time. Thus, the assessment of health condition is crucial for industrial systems.
Chaoqun Duan, V. Makis, C. Deng
semanticscholar +1 more source
Semi-Markov Process Based Reliability and Availability Prediction for Volunteer Cloud Systems
IEEE International Conference on Cloud Computing, 2018Alternative cloud systems that depend on spare resources of volunteer computers are emerging, complementing the conventional data center based clouds. These alternative cloud systems have one characteristic in common – they do not rely on dedicated data ...
Tessema M. Mengistu +3 more
semanticscholar +1 more source
A characterization for mixtures of semi-Markov processes
Statistics & Probability Letters, 2002A stepped right-continuous random process with a countable space of states \(I\) is considerd. It can be represented by the random sequence \((\sigma_j, \xi_j)_1^\infty\), where \(\sigma_j\) is the \(j\)th jump time, and \(\xi_j\in I\) is the value of the process at time \(\sigma_j\). Let \(\nu_{im}\) be the \(m\)th hitting time of the state \(i\in I\),
EPIFANI, ILENIA +2 more
openaire +3 more sources
Monotonicity in Generalized Semi-Markov Processes
Mathematics of Operations Research, 1992We establish stochastic monotonicity of the event epoch sequences of generalized semi-Markov processes through the structure of the generalized semi-Markov schemes on which they are based. Our main condition states, roughly, that the occurrence of more events in the short run never leads to the activation of less events in the long run.
Paul Glasserman, David D. Yao
openaire +2 more sources
Comparing Semi-Markov Processes
Mathematics of Operations Research, 1980Sufficient conditions are found for two semi-Markov processes to be stochastically ordered, i.e., for which two new semi-Markov processes can be constructed on a common probability space so that the new processes individually have the same distributions as the original processes and every sample path of the first new process lies below the ...
openaire +1 more source
On reversible semi-Markov processes
Operations Research Letters, 1994zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Functions of Semi-Markov Processes
SIAM Journal on Applied Mathematics, 1971A necessary and sufficient condition is presented under which a function of a semi-Markov process is again a semi-Markov process with transition probabilities which do not depend on the initial distribution of the original process. This result is a generalization of a known result for Markov processes.
openaire +1 more source