SciELO - Scientific Electronic Library Online

 
vol.18 issue4A Heuristic Approach for Blind Source Separation of Instant MixturesPeriodicity-Based Computation of Optical Flow author indexsubject indexsearch form
Home Pagealphabetic serial listing  

Services on Demand

Journal

Article

Indicators

Related links

  • Have no similar articlesSimilars in SciELO

Share


Computación y Sistemas

Print version ISSN 1405-5546

Abstract

LOPEZ-RAMIREZ, Blanca C.  and  CRUZ-CORTES, Nareli. Designing Minimal Sorting Networks Using a Bio-inspired Technique. Comp. y Sist. [online]. 2014, vol.18, n.4, pp.731-739. ISSN 1405-5546.  http://dx.doi.org/10.13053/CyS-18-4-1959.

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.

        · text in English     · English ( pdf )

 

Creative Commons License All the contents of this journal, except where otherwise noted, is licensed under a Creative Commons Attribution License