JAdaptiveSearch, written by Francesco Pagano, is a Java implementation of a benchmark for comparing the speed and memory access costs of the new Adaptive Search algorithm.
AdaptiveSearch is an algorithm for search /membership queries over ordered sets.
Please refer to the article for the details:
Adaptive search over sorted sets.
B. Bonasera, E. Ferrara, G. Fiumara, F. Pagano and A. Provetti, 2015.
Journal of Discrete Algorithms, Vol. 30, pp. 128-133.
Reviewed on MatSciNet: http://www.ams.org/mathscinet-getitem?mr=3305156.
- Please contact us before starting.
Who do I talk to?
Alessando Provetti is currently managing the repository.
Thanks to Salvatore Rapisarda for help with Apache Maven.