The Bayesian pursuit algorithm: a new family of estimator learning automata
IEA/AIE'11 Proceedings of the 24th international conference on Industrial engineering and other applications of applied intelligent systems conference on Modern approaches in applied intelligence - Volume Part II
| Hi-index | 0.00 |
Data Fragments Allocation is an important issue in designing Distributed Database System. This problem is NP-complete, and thus requires fast heuristics and random algorithms to generate efficient solutions, so many algorithms for solving that have been reported in the literature. In this paper we used an object migration learning automaton-based algorithm. This approach is able to get suitable solutions in a reasonable amount of time even for moderate sized problems. Experimental results show that proposed algorithm has significant superiority over the several well-known methods.