✦ LIBER ✦

Search problems: One, two or many rounds

✍ Scribed by Claude A. Christen

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 937 KB
Volume: 136
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00106-s

No coin nor oath required. For personal study only.

✦ Synopsis

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 in favor of an extension of the model, which raises new questions. Finally, some preliminary results in this still very much open direction are given. *Sadly, the author passed away in April 1994.

📜 SIMILAR VOLUMES

Optimal search for one of many objects h

Optimal search for one of many objects hidden in two boxes

✍ Ariela Sharlin 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 621 KB

A discrete search model for one of many objects hidden in two boxes is studied. The number of objects is assumed to be a random variable with a known prior distribution. When box i is searched, a cost ci > 0 is paid and the conditional probability of finding a specific object given it was hidden the

On two random search problems

✍ András Sebő 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 420 KB

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

Moment problems on random rounding rules

Moment problems on random rounding rules subject to two moment conditions

✍ G.A. Anastassiou; T. Rychlik 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 641 KB

Sharp upper and lower bounds are presented for the expectation of a randomly rounded nonnegative random variables satisfying a support constraint and two moment conditions. The rounding rule ascribes either the floor or the ceiling to a number due to a given two-point distribution.

Optimal algorithms for the many-to-one r

Optimal algorithms for the many-to-one routing problem on two-dimensional meshes

✍ Fillia Makedon; Antonios Symvonis 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 749 KB

Is designing one search or two? A model

Is designing one search or two? A model of design thinking involving symbolism and connectionism

✍ Yu-Tung Liu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 784 KB

In this paper, designing is interpreted as a combination of two searches: a shape restructuring search and a knowledge transforming search. During the first phase, designers or computer-aided design systems search for alternative ways to interpret for the current design state by restructuring shapes