enter search term and/or author name
Efficient simulation of buffer overflow probabilities in jackson networks with feedback
Sandeep Juneja, Victor Nicola
Consider a Jackson network that allows feedback and that has a single server at each queue. The queues in this network are classified as a single ‘target’ queue and the remaining ‘feeder’ queues. In this setting we develop the...
Algorithms for HLA-based distributed simulation cloning
Dan Chen, Stephen J. Turner, Wentong Cai, Boon Ping Gan, Malcolm Yoke Hean Low
Distributed simulation cloning technology is designed to analyze alternative scenarios of a distributed simulation concurrently within the same execution session. One important goal is to optimize execution by avoiding repeated computation among...
On the xorshift random number generators
François Panneton, Pierre L'Ecuyer
G. Marsaglia recently introduced a class of very fast xorshift random number generators, whose implementation uses three “xorshift” operations. They belong to a large family of generators based on linear recurrences modulo 2, which...
Very large fractional factorial and central composite designs
Susan M. Sanchez, Paul J. Sanchez
We present a concise representation of fractional factorials and an algorithm to quickly generate resolution V designs. The description is based on properties of a complete, orthogonal discrete-valued basis set called Walsh functions. We tabulate...