𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On two random search problems

✍ Scribed by András Sebő

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
420 KB
Volume
11
Category
Article
ISSN
0378-3758

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Random search techniques for optimizatio
Random search techniques for optimization problems
✍ Dean C. Karnopp 📂 Article 📅 1963 🏛 Elsevier Science 🌐 English ⚖ 663 KB

The attributes of flexibility and efficiency attainable with random search techniques are discussed as well as a scope of application ranging from uses involving high speed general purpose computers to extremely simple adaptive devices. ## 1. Introduction ONLY IN recent years has serious study bee

Search problems: One, two or many rounds
Search problems: One, two or many rounds
✍ Claude A. Christen 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 937 KB

The aim of this paper is to introduce the reader to combinatorial search theory and to give him the flavour of this topic. The paper surveys the main results about a particular problem (the quantitative detection problem) and indicates some connections with other problems and fields. It then argues

Note: Two rendezvous search problems on
Note: Two rendezvous search problems on the line
✍ Vic Baston 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 28 KB 👁 1 views

A new upper bound is obtained for the two-person symmetric rendezvous value on the real line when the distribution function of their initial distance apart is bounded. A second result shows that if three players are placed randomly on adjacent integers on the real line facing in random directions an

On polychotomous search problems
On polychotomous search problems
✍ Karl Hinderer; Michael Stieglitz 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 917 KB