Using symmetry and evolutionary search to minimize sorting networks

MaRDI QIDQ5405249zbMATH OpenFDO

Authors Vinod K. Valsalam, Risto Miikkulainen

Publication date 1 April 2014

Full work available at URL http://www.jmlr.org/papers/v14/valsalam13a.html

zbMATH Keywords

symmetrycombinatorial optimizationevolutionestimation of distribution algorithmssorting networks

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• Optimizing sorting algorithms by using sorting networks
• Applying sorting networks to synthesize optimized sorting libraries
• Publication:3489795
• Optimal sorting networks
• scientific article; zbMATH DE number 1418031

Cited in

(4)

• Sorting networks: to the end and back again
• New Bounds on Optimal Sorting Networks
• Merging almost sorted sequences yields a 24-sorter
• Applying sorting networks to synthesize optimized sorting libraries

This page was built for publication: Using symmetry and evolutionary search to minimize sorting networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5405249)