Parallel tabu search algorithm for data structure composition

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we propose a parallel tabu search algorithm to solve the problem of the distributed database optimal logical structure synthesis. We provide a reader with information about the performance metrics of our parallel algorithm and the quality of the solutions obtained in comparison with the earlier developed consecutive algorithm and other methods. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Babkin, E., Karpunina, M., & Aseeva, N. (2011). Parallel tabu search algorithm for data structure composition. In Lecture Notes in Business Information Processing (Vol. 90 LNBIP, pp. 110–123). Springer Verlag. https://doi.org/10.1007/978-3-642-24511-4_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free