Beta
ManageSearchChatDiscover
313572

Multiplicative Linear Search Problem

Article

Last updated: 28 Dec 2024

OverviewSimilar Items

Subjects

-

Tags

-

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.  

DOI

10.21608/esju.2004.313572

Keywords

Expectation Value, Linear Search, Multiple, Searchers, Search Plans

Volume

48

Article Issue

1

Related Issue

42996

Issue Date

2004-06-01

Publish Date

2004-06-01

Page Start

34

Page End

54

Print ISSN

0542-1748

Online ISSN

2786-0086

Link

https://esju.journals.ekb.eg/article_313572.html

Detail API

https://esju.journals.ekb.eg/service?article_code=313572

Order

4

Type

Original Article

Type Code

1,914

Publication Type

Journal

Publication Title

The Egyptian Statistical Journal

Publication Link

https://esju.journals.ekb.eg/

MainTitle

Multiplicative Linear Search Problem

Details

Type

Article

Created At

28 Dec 2024