Linear search with bounded resources

DOI<link itemprop=identifier href="https://doi.org/10.1002/1520-6750(199108)38:4<555::AID-NAV3220380408>3.0.CO;2-8" /><555::AID-NAV3220380408>3.0.CO;2-8 10.1002/1520-6750(199108)38:4<555::AID-NAV3220380408>3.0.CO;2-8zbMath0732.90042OpenAlexW2084079969MaRDI QIDQ3359984

No author found.

Publication date: 1991

Full work available at URL: https://doi.org/10.1002/1520-6750(199108)38:4<555::aid-nav3220380408>3.0.co;2-8

zbMATH Keywords

random point placement

Mathematics Subject Classification ID

Search theory (90B40)

Related Items (2)

Rendezvous search on the line with bounded resources: Expected time minimization ⋮ A generalization of Lévy's concentration-variance inequality

Cites Work

• Search games

This page was built for publication: Linear search with bounded resources