More on the search for an infiltrator
✍ Scribed by Ljiljana Pavlović
- Publisher
- John Wiley and Sons
- Year
- 2002
- Tongue
- English
- Weight
- 173 KB
- Volume
- 49
- Category
- Article
- ISSN
- 0894-069X
- DOI
- 10.1002/nav.1047
No coin nor oath required. For personal study only.
✦ Synopsis
Abstract
We have asymptotically solved a discrete search game on an array of n ordered cells with two players: infiltrator (hider) and searcher, when the probability of survival approaches 1. The infiltrator wishes to reach the last cell in finite time, and the searcher has to defend that cell. When the players occupy the same cell, the searcher captures the infiltrator with probability 1 − z. The payoff to the hider is the probability that the hider reaches the last cell without getting captured. © 2002 John Wiley & Sons, Inc. Naval Research Logistics, 49: 1–14, 2002; DOI 10.1002/nav.1047
📜 SIMILAR VOLUMES
## IN MEMORY OF MICHIO SUZUKI Let k be a field of characteristic p, and let S be the symmetric group of degree n n. Assume that n -3 p. Let A be the centralizer in kS of kS . We find all n n y1 simple A-modules, and relate the number of non-projective simple A-modules to p-local information.
From the acclaimed author of _Einstein's Dreams,_ here is an inspires, lyrical meditation on religion and science that explores the tension between our yearning for permanence and certainty, and the modern scientific discoveries that demonstrate the impermanent and uncertain nature of the world. A
The nation's `taster in chief' cycles 3,500km across France in search of the definitive versions of classic French dishes. One of the chief pleasures of cycling, apart from the thrill of freedom it gives you, is stopping for lunch, so ravenous you inhale the bread basket before they've even had time