An adaptive global-local memetic algorithm to discover resources in P2P networks

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

Abstract

This paper proposes a neural network based approach for solving the resource discovery problem in Peer to Peer (P2P) networks and an Adaptive Global Local Memetic Algorithm (AGLMA) for performing the training of the neural network. This training is very challenging due to the large number of weights and noise caused by the dynamic neural network testing. The AGLMA is a memetic algorithm consisting of an evolutionary framework which adaptively employs two local searchers having different exploration logic and pivot rules. Furthermore, the AGLMA makes an adaptive noise compensation by means of explicit averaging on the fitness values and a dynamic population sizing which aims to follow the necessity of the optimization process. The numerical results demonstrate that the proposed computational intelligence approach leads to an efficient resource discovery strategy and that the AGLMA outperforms two classical resource discovery strategies as well as a popular neural network training algorithm. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Neri, F., Kotilainen, N., & Vapa, M. (2007). An adaptive global-local memetic algorithm to discover resources in P2P networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4448 LNCS, pp. 61–70). Springer Verlag. https://doi.org/10.1007/978-3-540-71805-5_7

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