English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Suppose two blind agents with unit speed are placed a distanceH apart on an infinite line, and faced in random directions. Their initial distanceH is picked from a distributionF with finite mean 脗µ. We present a pair of rendezvous strategies which do not depend on the distributionF and ensure a meeting in expected time less than 5:514脗µ. This improves the bound of 5:74脗µ given by Baston and Gal. Furthermore, the bound we give is best possible for strategies of our type.

Pure Strategy Asymmetric Rendezvous on the Line with an Unknown Initial Distance