✦ LIBER ✦

Note: Two rendezvous search problems on the line

✍ Scribed by Vic Baston

Publisher: John Wiley and Sons
Year: 1999
Tongue: English
Weight: 28 KB
Volume: 46
Category: Article
ISSN: 0894-069X
DOI: 10.1002/(sici)1520-6750(199904)46:3<335::aid-nav6>3.0.co;2-q

No coin nor oath required. For personal study only.

✦ Synopsis

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 and able to move at a speed of at most 1, then they can ensure a three-way meeting time of at most 7/2; the fact that 7/2 is a best possible result follows from work already in the literature.

📜 SIMILAR VOLUMES

Note: On the two-machine no-idle flowsho

Note: On the two-machine no-idle flowshop problem

✍ Ondřej Čepek; Masanori Okada; Milan Vlach 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 290 KB 👁 1 views

In this short note we study a two-machine flowshop scheduling problem with the additional no-idle feasibility constraint and the total completion time criterion function. We show that one of the few papers which deal with this special problem contains incorrect claims and suggest a way how these cla

A note on the generalized due dates sche

A note on the generalized due dates scheduling problems

✍ C. Sriskandarajah 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 487 KB 👁 2 views

A note on the bottleneck graph partition

A note on the bottleneck graph partition problem

✍ Klinz, Bettina; Woeginger, Gerhard J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit

A note on the blasius problem for viscoe

A note on the blasius problem for viscoelastic fluids

✍ R. W. Serth 📂 Article 📅 1973 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 289 KB 👁 2 views

On a personal note the problem with fami

On a personal note the problem with familiar rituals

✍ Miriam Carver 📂 Article 📅 2005 🏛 John Wiley and Sons ⚖ 257 KB

Encounters with the OPAC: On-line search

Encounters with the OPAC: On-line searching in public libraries

✍ Slone, Debra J. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 118 KB

This article reports on a qualitative study exploring: (1) strategies and behaviors of public library users during interaction with an on-line public access catalog; and (2) users' confidence in finding needed information on-line. Questionnaires, interviews, and observations were employed to gather