Tackling the Error Correcting Code Problem Via the Cooperation of Local-Search-Based Agents

Authors:
Jhon Edgar Amaya;Carlos Cotta;Antonio J. Fernández
Affiliations:
Universidad Nacional Experimental del Táchira (UNET), Laboratorio de Computación de Alto Rendimiento (LCAR), San Cristóbal, Venezuela;Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, University of Málaga, Campus de Teatinos, 29071 - Málaga, Spain;Dept. Lenguajes y Ciencias de la Computación, ETSI Informática, University of Málaga, Campus de Teatinos, 29071 - Málaga, Spain
Venue:
IWINAC '07 Proceedings of the 2nd international work-conference on Nature Inspired Problem-Solving Methods in Knowledge Engineering: Interplay Between Natural and Artificial Computation, Part II
Year:
2007

Citing 4
Cited 0

Parallel Genetic Simulated Annealing: A Massively Parallel SIMD Algorithm

IEEE Transactions on Parallel and Distributed Systems
An Electromagnetism-like Mechanism for Global Optimization

Journal of Global Optimization
Solving the error correcting code problem with parallel hybrid heuristics

Proceedings of the 2004 ACM symposium on Applied computing
A table of upper bounds for binary codes

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of designing error correcting codes (ECC), a hard combinatorial optimization problem of relevance in the field of telecommunications. This problem is firstly approached via a battery of local search (LS) methods that are compared and analyzed. Then, we study how to tackle this problem by having a society of interacting autonomous agents where each agent is endowed with a specific (not necessarily unique) strategy for local improvement. Distinct topologies and forms of interaction are analyzed and discussed in the paper. Specifically, it is shown how the election of the LS methods and their combination influences the results. An empirical evaluation shows that agent-based models are promising to solve of this problem.