Showing 1 - 10 of 75
Persistent link: https://www.econbiz.de/10003864821
This paper reports simulation experiments, applying the cross entropy method suchas the importance sampling algorithm for efficient estimation of rare event probabilities in Markovian reliability systems. The method is compared to various failurebiasing schemes that have been proved to give...
Persistent link: https://www.econbiz.de/10011334846
Persistent link: https://www.econbiz.de/10001928203
Persistent link: https://www.econbiz.de/10000930032
We develop a methodology for studying large deviations type questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a larg class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are...
Persistent link: https://www.econbiz.de/10010325426
We develop a methodology for studying ''large deviations type'' questions. Our approach does not require that the large deviations principle holds, and is thus applicable to a larg class of systems. We study a system of queues with exponential servers, which share an arrival stream. Arrivals are...
Persistent link: https://www.econbiz.de/10010325503
A version of the classical secretary problem is studied, in which one is interested in selecting one of the b best out of a group of n differently ranked persons who are presented one by one in a random order. It is assumed that b is bigger than or equal to 1 is a preassigned number. It is...
Persistent link: https://www.econbiz.de/10010325704
There are various importance sampling schemes to estimate rare event probabilities in Markovian systems such as Markovian reliability models and Jackson networks. In this work, we present a general state dependent importance sampling method which partitions the state space and applies the...
Persistent link: https://www.econbiz.de/10010325747
A sequence of real numbers (xn) is Benford if the significands, i.e. the fractionparts in the floating-point representation of (xn), are distributed logarithmically.Similarly, a discrete-time irreducible and aperiodic finite-state Markov chain withprobability transition matrix P and limiting...
Persistent link: https://www.econbiz.de/10010325878
We apply the splitting method to three well-known counting problems, namely 3-SAT, random graphs with prescribed degrees, and binary contingency tables. We present an enhanced version of the splitting method based on the capture-recapture technique, and show by experiments the superiority of...
Persistent link: https://www.econbiz.de/10010325899