Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
Instituto Politécnico Nacional
2014
|
| Subjects: | |
| Online Access: | https://www.redalyc.org/articulo.oa?id=61532985008 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- Designing Minimal Sorting Networks Using a Bio-inspired Technique Blanca C. López-Ramírez Nareli Cruz-Cortés Computación Sorting Networks (SN) are efficient tools to sort an input data sequence. They are composed by a set of comparison-exchange operations called compara- tors. The comparators are a priori fixed for a determined input size. The comparators are independent of the input configuration. SN with a minimal number of comparators results in an optimal manner to sort data; it is a classical NP-hard problem studied for more than 50 years. In this paper we adapted a biological inspired heuristic called Artificial Immune System to evolve candidate sets of SN. Besides, a local strategy is proposed to consider the information regarding comparators and sequences to be ordered at a determined building stage. New optimal Sorting Networks designs for input sizes from 9 to 15 are presented. 2014 artículo científico 1405-5546 https://www.redalyc.org/articulo.oa?id=61532985008 en http://www.redalyc.org/revista.oa?id=615 Computación y Sistemas application/pdf Instituto Politécnico Nacional Computación y Sistemas (México) Num.4 Vol.18