We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
Tobias Friedrich, Martin Gairing, Thomas Sauerwald
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
Stefan Boettcher, Allon G. Percus, Michelangelo Gr...
We present STAR, a self-tuning algorithm that adaptively sets numeric precision constraints to accurately and efficiently answer continuous aggregate queries over distributed data...
Navendu Jain, Michael Dahlin, Yin Zhang, Dmitry Ki...
In large wireless sensor networks, the problem of assigning radio frequencies to sensing agents such that no two connected sensors are assigned the same value (and will thus inter...
Ruben Stranders, Alex Rogers, Nicholas R. Jennings
Scalable similarity search is the core of many large scale learning or data mining applications. Recently, many research results demonstrate that one promising approach is creatin...