2 papers
cs.DS2017
Efficient Adaptive Implementation of the Serial Schedule Generation Scheme using Preprocessing and Bloom Filters
Daniel Karapetyan, Alexei Vernitski
The majority of scheduling metaheuristics use indirect representation of solutions as a way to efficiently explore the search space. Thus, a crucial part of such metaheuristics is…
cs.DS2016
Yes-no Bloom filter: A way of representing sets with fewer false positives
Laura Carrea, Alexei Vernitski, Martin Reed
The Bloom filter (BF) is a space efficient randomized data structure particularly suitable to represent a set supporting approximate membership queries. BFs have been extensively u…