๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Rendezvous search on labeled networks

โœ Scribed by Steve Alpern

Publisher
John Wiley and Sons
Year
2002
Tongue
English
Weight
191 KB
Volume
49
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

Mazes: Search games on unknown networks
Mazes: Search games on unknown networks
โœ E. J. Anderson ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 250 KB

## Abstract This paper discusses a class of search problems on networks, where the searcher only has information about that part of the network which he has traversed. These problems correspond to that of finding the exit of a maze. In this context it is natural to consider the two person game betw

Parallel Labeling of Three-Dimensional C
Parallel Labeling of Three-Dimensional Clusters on Networks of Workstations
โœ Felipe Knop; Vernon Rego ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 323 KB

Cluster algorithms have application in diverse areas, including statistical mechanics of polymer solutions, spin models in physics, and the study of ecological systems. Most parallel cluster labeling algorithms are designed for SIMD and MIMD multiprocessors and based on relaxation methods. We presen