2021
DOI: 10.1504/ijor.2021.10024709
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Multiplicative Generalized Coordinated Search Technique to Find a D-Dimensional Random Walker

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 0 publications
0
1
0
Order By: Relevance
“…To do this, we use n cooperative searchers as in El-Hadidy et al [1,2,20,28]. But, the technique which was used in El-Hadidy et al [1,2,20,28] wasted a lot of costs because the searching process is repeated in the same part more than once. Our model does not waste this cost because the searchers do not repeat the searching process by using the connection technology methods.…”
Section: Problem Formulationmentioning
confidence: 99%
“…To do this, we use n cooperative searchers as in El-Hadidy et al [1,2,20,28]. But, the technique which was used in El-Hadidy et al [1,2,20,28] wasted a lot of costs because the searching process is repeated in the same part more than once. Our model does not waste this cost because the searchers do not repeat the searching process by using the connection technology methods.…”
Section: Problem Formulationmentioning
confidence: 99%