| Revista: | Computación y sistemas |
| Base de datos: | PERIÓDICA |
| Número de sistema: | 000381264 |
| ISSN: | 1405-5546 |
| Autores: | López Ramírez, Blanca C1 Cruz Cortés, Nareli1 |
| Instituciones: | 1Instituto Politécnico Nacional, Centro de Investigación en Computación, México, Distrito Federal. México |
| Año: | 2014 |
| Periodo: | Oct-Dic |
| Volumen: | 18 |
| Número: | 4 |
| Paginación: | 731-740 |
| País: | México |
| Idioma: | Inglés |
| Tipo de documento: | Artículo |
| Enfoque: | Experimental, aplicado |
| Resumen en inglés | Sorting Networks (SN) are efficient tools to sort an input data sequence. They are composed by a set of comparison-exchange operations called comparators. 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 |
| Disciplinas: | Ciencias de la computación |
| Palabras clave: | Procesamiento de datos, Redes, Redes de ordenamiento, Comparadores, Secuencia de datos |
| Keyword: | Computer science, Data processing, Networks, Sorting networks, Comparators, Data sequence |
| Texto completo: | Texto completo (Ver HTML) |
