Results 111 to 120 of about 14,932 (164)
Stochastic modelling of delays and buffering in 5G-IoT ecosystems with programmable P4 switches based on BMAP. [PDF]
Kovtun V +3 more
europepmc +1 more source
Dynamic community detection using class preserving time series generation with Fourier Markov diffusion. [PDF]
Ma Y, Qu D, Wang Y.
europepmc +1 more source
The occurrence of a particular state is a predictor of successful travel consultation. [PDF]
Honda H +5 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Discounted semi-markov decision process in a semi-markov environment
Optimization, 1997This paper presents the discounted semi-Markov decision process (SMDP) with Borel state space in a semi-Markov environment. It describes a system which behaves like a SMDP except that the system is influenced by its semi-Markov process environment. Following each state transition of the environment, the parameters of the SMDP changes.
exaly +2 more sources
Using Semi-Markov Chains to Solve Semi-Markov Processes
Methodology and Computing in Applied Probability, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wu, Bei +2 more
openaire +3 more sources
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

