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.
Mohamed, A. E., & Abou Gabal, H. (2004). Multiplicative Linear Search Problem. The Egyptian Statistical Journal, 48(1), 34-54. doi: 10.21608/esju.2004.313572
MLA
Abd El-Moneim A. Mohamed; Hamdy M. Abou Gabal. "Multiplicative Linear Search Problem", The Egyptian Statistical Journal, 48, 1, 2004, 34-54. doi: 10.21608/esju.2004.313572
HARVARD
Mohamed, A. E., Abou Gabal, H. (2004). 'Multiplicative Linear Search Problem', The Egyptian Statistical Journal, 48(1), pp. 34-54. doi: 10.21608/esju.2004.313572
VANCOUVER
Mohamed, A. E., Abou Gabal, H. Multiplicative Linear Search Problem. The Egyptian Statistical Journal, 2004; 48(1): 34-54. doi: 10.21608/esju.2004.313572
)
View on SCiNiTO