A Most Irrational Foraging Algorithm
Distributed, Parallel, and Cluster Computing
2019-11-28 v1
Abstract
We present a foraging algorithm, GoldenFA, in which search direction is chosen based on the Golden Ratio. We show both theoretically and empirically that GoldenFA is more efficient for a single searcher than a comparable algorithm where search direction is chosen uniformly at random. Moreover, we give a variant of our algorithm that parallelizes linearly with the number of searchers.
Cite
@article{arxiv.1911.11973,
title = {A Most Irrational Foraging Algorithm},
author = {Abhinav Aggarwal and William F. Vining and Diksha Gupta and Jared Saia and Melanie E. Moses},
journal= {arXiv preprint arXiv:1911.11973},
year = {2019}
}
Comments
Presented at BDA 2019 (co-located with PODC 2019)