A method is described for the efficient estimation of small overflow probabilities in nonMarkovian queueing network models. The method uses importance sampling with a state-dependent change of measure, which is determined adaptively using the cross-entropy method, thus avoiding the need for a detailed mathematical analysis. Experiments show that the use of rescheduling is needed in order to get a significant simulation speedup, and that the method can be used to estimate overflow probabilities in a two-node tandem queue network model for which simulation using a state-independent change of measure does not work well
This paper considers importance sampling as a tool for rare-event simulation. The focus is on estima...
This paper considers importance sampling as a tool for rare-event simulation. The focus is on estima...
In this paper, we propose a fast adaptive importance sampling method for the efficient simulation of...
A method is described for the efficient estimation of small overflow probabilities in non-Markovian ...
In this paper, a method is presented for the efficient estimation of rare-event (buffer overflow) pr...
In this paper, a method is presented for the efficient estimation of rare-event (overflow) probabili...
There are various importance sampling schemes to estimate rare event probabilities in Markovian syst...
In this paper, we propose a fast adaptive importance sampling method for the efficient simulation of...
There are various importance sampling schemes to estimate rare event probabilities in Markovian syst...
In this paper we propose a fast adaptive Importance Sampling method for the efficient simulation of ...
In this paper we propose a fast adaptive Importance Sampling method for the efficient simulation of ...
In this paper we propose a fast adaptive Importance Sampling method for the efficient simulation of ...
In this paper we propose a fast adaptive importance sampling method for the efficient simulation of ...
In this thesis we propose state-dependent importance sampling heuristics to estimate the probability...
We present a fast algorithm for the efficient estimation of rare-event (buffer overflow) probabiliti...
This paper considers importance sampling as a tool for rare-event simulation. The focus is on estima...
This paper considers importance sampling as a tool for rare-event simulation. The focus is on estima...
In this paper, we propose a fast adaptive importance sampling method for the efficient simulation of...
A method is described for the efficient estimation of small overflow probabilities in non-Markovian ...
In this paper, a method is presented for the efficient estimation of rare-event (buffer overflow) pr...
In this paper, a method is presented for the efficient estimation of rare-event (overflow) probabili...
There are various importance sampling schemes to estimate rare event probabilities in Markovian syst...
In this paper, we propose a fast adaptive importance sampling method for the efficient simulation of...
There are various importance sampling schemes to estimate rare event probabilities in Markovian syst...
In this paper we propose a fast adaptive Importance Sampling method for the efficient simulation of ...
In this paper we propose a fast adaptive Importance Sampling method for the efficient simulation of ...
In this paper we propose a fast adaptive Importance Sampling method for the efficient simulation of ...
In this paper we propose a fast adaptive importance sampling method for the efficient simulation of ...
In this thesis we propose state-dependent importance sampling heuristics to estimate the probability...
We present a fast algorithm for the efficient estimation of rare-event (buffer overflow) probabiliti...
This paper considers importance sampling as a tool for rare-event simulation. The focus is on estima...
This paper considers importance sampling as a tool for rare-event simulation. The focus is on estima...
In this paper, we propose a fast adaptive importance sampling method for the efficient simulation of...