A graph-based approach to the sorting network problem

Proceedings of the IEEE Conference on Evolutionary Computation, ICEC

Volumn 1, Issue , 2001, Pages 457-464

  Choi, S S ^a   Moon, B R ^a  

^a Seoul National University   (South Korea)

Author keywords

Combinatorial optimization; Evolutionary computation; Genetic algorithm; Sorting networks

Indexed keywords

COMBINATORIAL MATHEMATICS; GENETIC ALGORITHMS; GRAPH THEORY; HEURISTIC METHODS; OPTIMIZATION; PERSONAL COMPUTERS;

COMBINATORIAL OPTIMIZATION;

SORTING;

EID: 0034871016     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. A new internal sorting method
2. Evolving aesthetic sorting networks using developmental grammars
3. A sorting problem
4. Genetic algorithm and graph partitioning
5. Evolving sorting networks using genetic programming and the rapidly reconfigurable Xilinx 6216 field-programmable gate array
6. Improved constructions for the bose-nelson sorting problem
7. Co-evolving parasites improve simulated evolution as an optimization procedure
8. Evolution of non-deterministic incremental algorithms as a new approach for search in state spaces
9. Genitor: A different genetic algorithm