Results 51 to 60 of about 84,208 (194)
Excursion theory for Markov processes indexed by Lévy trees
Abstract We develop an excursion theory that describes the evolution of a Markov process indexed by a Lévy tree away from a regular and instantaneous point x$x$ of the state space. The theory builds upon a notion of local time at x$x$ that was recently introduced in the companion paper [Probab. Theory Related Fields. 189 (2024), 1–99].
Armand Riera, Alejandro Rosales‐Ortiz
wiley +1 more source
Abstract With the deepening of research on smart grids, the distribution system has gradually evolved into a cyber‐physical distribution system (CPDS). The refined reliability modelling and assessment methods for CPDS are of great significance. This paper proposes an integrated reliability assessment framework combining distribution information system (
Wei Wu +9 more
wiley +1 more source
Priority Auctions and Queue Disciplines that Depend on Processing Time [PDF]
Lecture on the first SFB/TR 15 meeting, Gummersbach, July, 18 - 20, 2004We analyze the allocation of priority in queues via simple bidding mechanisms. In our model, the stochastically arriving customers are privately informed about their own processing ...
Thomas Kittsteiner +3 more
core +1 more source
This work considers a preemptive priority queueing system with vacation, where the single server may break down with imperfect coverage. Various combinations of server vacation priority queueing models have been studied by many scholars.
Tzu-Hsin Liu +3 more
doaj +1 more source
Probabilistic analysis of buffer starvation in Markovian queues [PDF]
Our purpose in this paper is to obtain the \emph{exact distribution} of the number of buffer starvations within a sequence of $N$ consecutive packet arrivals. The buffer is modeled as an M/M/1 queue. When the buffer is empty, the service restarts after a certain amount of packets are \emph{prefetched}.
Xu, Yuedong +5 more
openaire +3 more sources
ABSTRACT Deployment of autonomous driving trucks (ADTs) in open‐pit mining enables more flexible transport operations than human‐driven trucks; but this flexibility significantly expands the scheduling search space and makes it more difficult to find near‐optimal solutions on large scales.
Rentao Sun +3 more
wiley +1 more source
Stochastic Monotonicity of Markovian Multiclass Queueing Networks [PDF]
Multiclass queueing networks (McQNs) extend the classical concept of the Jackson network by allowing jobs of different classes to visit the same server. Although such a generalization seems rather natural, from a structural perspective, there is a significant gap between the two concepts. Nice analytical features of Jackson networks, such as stability
Leahu Haralambie, Michel Mandjes
openaire +3 more sources
Fuzzy States to Enhance Train Delay Prediction of Markov Chains
This study introduces Markov chains with fuzzy delay states with triangular membership functions for the first time to model train delay predictions. It is shown that the prediction errors can be reduced by the fuzzification adoption. ABSTRACT Markov chains provide distinctive advantages and practical applicability in modeling of train delays.
Mehmet Şirin Artan, İsmail Şahin
wiley +1 more source
The present investigation studies a hybrid hiatus policy for a finite-space Markovian queue, incorporating realistic features such as Bernoulli feedback, multiple servers, and balking customers. A hybrid hiatus policy combines both a working hiatus and a
Aimen Dehmi +3 more
doaj +1 more source
Exponential bounds for queues with Markovian arrivals
The main results of the paper deal with the bounds of the queue length distribution. Particularly, for the case of Markovian arrivals the exponential upper bounds are derived. These results are commented in the framework of several examples.
openaire +4 more sources

