The Beachcombers’ Problem: Walking and Searching from an Inner Point of a Line

DOI10.1007/978-3-319-30000-9_21zbMath1443.68027OpenAlexW2408695839MaRDI QIDQ2798726

Ziwei Ji, Yu Chen, Chao Liao, Xiaotie Deng

Publication date: 13 April 2016

Published in: Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-30000-9_21

zbMATH Keywords

computational complexitypartitioningschedulesearchingmobile agentswalking

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Distributed algorithms (68W15) Agent technology and artificial intelligence (68T42)

Related Items (1)

Beachcombing on strips and islands

This page was built for publication: The Beachcombers’ Problem: Walking and Searching from an Inner Point of a Line