SETNDS: A SET-Based Non-Dominated Sorting Algorithm for Multi-Objective Optimization Problems
Applied Sciences, 2020 Non-dominated sorting, used to find pareto solutions or assign solutions to different fronts, is a key but time-consuming process in multi-objective evolutionary algorithms (MOEAs).
Lingling Xue, Peng Zeng, Haibin Yu
doaj +1 more source
Fast Sorting Algorithms using AVX-512 on Intel Knights Landing [PDF]
arXiv.org, 2017 This paper describes fast sorting techniques using the recent AVX-512 instruction set. Our implementations benefit from the latest possibilities offered by AVX-512 to vectorize a two-parts hybrid algorithm: we sort the small arrays using a branch-free ...
Bérenger Bramas
openalex +3 more sources
Integrating Pareto Optimization into Dynamic Programming
Algorithms, 2016 Pareto optimization combines independent objectives by computing the Pareto front of the search space, yielding a set of optima where none scores better on all objectives than any other.
Thomas Gatter +2 more
doaj +1 more source
Omnidirectional-Wheel Conveyor Path Planning and Sorting Using Reinforcement Learning Algorithms
IEEE Access, 2022 In this paper, path planning and sorting of packages for Omnidirectional-Wheel conveyor are presented using Reinforcement Learning (RL). Q-learning, Double Q-learning, Deep Q-learning, and the Double Deep Q-learning algorithms are investigated.
Walid Zaher +4 more
doaj +1 more source
Analysis-driven Engineering of Comparison-based Sorting Algorithms on GPUs
International Conference on Supercomputing, 2018 We study the relationship between memory accesses, bank conflicts, thread multiplicity (also known as over-subscription) and instruction-level parallelism in comparison-based sorting algorithms for Graphics Processing Units (GPUs).
Ben Karsin +4 more
semanticscholar +1 more source
, 2008 Práce se zabývá problémem třídění polí, který patří mezi známé problémy informatiky. Definuje pojmy třídění, algoritmus a složitost algoritmů. Popisuje vybrané algoritmy pro třídění od nejjednodušších po vybrané složitější konstrukce.
Lýsek, Jiří
core +2 more sources
Modern Approaches to Exact Diagonalization and Selected Configuration Interaction with the Adaptive Sampling CI Method. [PDF]
, 2019 Recent advances in selected configuration interaction methods have made them competitive with the most accurate techniques available and, hence, creating an increasingly powerful tool for solving quantum Hamiltonians.
Freeman, C Daniel +5 more
core +2 more sources
Design and Large-scale Evaluation of Educational Games for Teaching Sorting Algorithms
Informatics Educ., 2017 . The teaching of sorting algorithms is an essential topic in undergraduate computing courses. Typically the courses are taught through traditional lectures and exercises involving the implementation of the algorithms.
P. Battistella +2 more
semanticscholar +1 more source
Comparison Of Hybrid Sorting Algorithms Implemented On Different Parallel Hardware Platforms
Computer Science, 2013 Sorting is a common problem in computer science. There are lot of well-known sorting algorithms created for sequential execution on a single processor. Recently, hardware platforms enable to create wide parallel algorithms.
Dominik Zurek +3 more
doaj +1 more source
Set-Oriented Mining for Association Rules in Relational Databases [PDF]
, 1995 Describe set-oriented algorithms for mining association rules. Such algorithms imply performing multiple joins and may appear to be inherently less efficient than special-purpose algorithms. We develop new algorithms that can be expressed as SQL queries,
Houtsma, M.A.W., Swami, A.
core +3 more sources