𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The distribution of the time-duration of stochastic duels

✍ Scribed by C. J. Ancker Jr.; A. V. Gafarian


Publisher
John Wiley and Sons
Year
1965
Tongue
English
Weight
607 KB
Volume
12
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis


The Theory of Stochastic Duels i s extended by considering the d i stribution of time -to-completion of the fundamental duel. The model has fixed kill probabilities and either random o r fixed t i m e between rounds fired. Time-limitation i s included. Special c a s e s and examples a r e worked out. Clearly, the time-duration of combat has both tactical and logistic implications f o r the decision-maker.


πŸ“œ SIMILAR VOLUMES


The stochastic duel with time-dependent
✍ C. J. Ancker Jr. πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 354 KB

## Abstract The fundamental stochastic duel considers two opponents who fire at each other at either random continuous or fixed‐time intervals with a constant hit probability on each round fired. Each starts with an unloaded weapon, unlimited ammunition, and unlimited time. The first to hit wins. I

The distribution of file transmission du
✍ R. Nossenson; H. Attiya πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 198 KB

## Abstract It is well known that the distribution of files transmission duration in the Web is __heavy‐tailed__ (A practical guide to Heavy Tails: Statistical Techniques and Application. Birkhauser: Boston, 1998; 3–26). This paper attempts to understand the reasons for this phenomenon by isolating

The characteristic times of the transien
✍ J.I. JimΓ©nez-Aquino πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 765 KB

A systematic method is developed for the calculation of characteristic times, called nonlinear relaxation times (NLRT), to describe the dynamical relaxation of the linear transient stochastic systems whose control parameters are time-dependent functions. For those control parameters, which are modul

Algorithms to calculate the distribution
✍ Lawrence M. Leemis; Matthew J. Duggan; John H. Drew; Jeffrey A. Mallozzi; Kerry πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 397 KB

## Abstract We develop algorithms to calculate the probability distribution of the longest path of an arbitrary stochastic activity network with continuous activity durations by three techniques: recursive Monte Carlo simulation, series‐parallel reduction, and conditioning. Examples illustrate the