Multiplicative Linear Search Problem | ||||
| The Egyptian Statistical Journal | ||||
| Article 4, Volume 48, Issue 1, June 2004, Page 34-54 PDF (5.5 MB) | ||||
| Document Type: Original Article | ||||
| DOI: 10.21608/esju.2004.313572 | ||||
 View on SCiNiTO | ||||
| Authors | ||||
| Abd El-Moneim A. Mohamed* ; Hamdy M. Abou Gabal* | ||||
| Department of Mathematics, Faculty of Science, Tanta University, Egypt | ||||
| Abstract | ||||
| The purpose of this paper is to study the multiplicative linear search problem. This problem is concerned with finding a target randomly located on one of n disjoint lines. When the target is located on a real line this problem was studied. Here the expected value of the first meeting time of the target and conditions under which we can minimize the expected value will be given. | ||||
| Keywords | ||||
| Expectation Value; Linear Search; Multiple; Searchers; Search Plans | ||||
|
Statistics Article View: 89 PDF Download: 4 |
||||
