A Most Irrational Foraging Algorithm

11/27/2019
by   Abhinav Aggarwal, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/15/2022

Degree of Convexity and Expected Distances in Polygons

We present an algorithm for computing the so-called Beer-index of a poly...
research
07/25/2022

Improved Bounds for Sampling Solutions of Random CNF Formulas

Let Φ be a random k-CNF formula on n variables and m clauses, where each...
research
01/12/2018

The Asymptotic Capacity of Private Search

The private search problem is introduced, where a dataset comprised of L...
research
10/23/2014

Justifying and Improving Meta-Agent Conflict-Based Search

The Meta-Agent Conflict-Based Search (MA-CBS) is a recently proposed alg...
research
01/04/2021

An 𝒪(n) algorithm for generating uniform random vectors in n-dimensional cones

Unbiased random vectors i.e. distributed uniformly in n-dimensional spac...
research
06/15/2016

A Class of Parallel Doubly Stochastic Algorithms for Large-Scale Learning

We consider learning problems over training sets in which both, the numb...
research
11/20/2017

On estimating the alphabet size of a discrete random source

We are concerned with estimating alphabet size N from a stream of symbol...

Please sign up or login with your details

Forgot password? Click here to reset