Results 21 to 30 of about 57,373 (301)
Sorting and Classification of Sorting Algorithms [PDF]
Sorting and searching are fundamental problems in computer science that have attracted theattention of the researchers from the past. Sorting algorithms never remained the same buthave evolved from the past and new approaches have been developed to solve
Rouf Ali
core +1 more source
Parallel Multidimensional Lookahead Sorting Algorithm
This paper presents a new parallel structured lookahead multidimensional sorting algorithm. Our algorithm can be based on any sequential sorting algorithm. The amount of parallelism can be controlled using several parameters such as the number of threads,
Fayez Gebali +4 more
doaj +1 more source
Integrating Pareto Optimization into Dynamic Programming
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
SETNDS: A SET-Based Non-Dominated Sorting Algorithm for Multi-Objective Optimization Problems
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
Feature extraction using extrema sampling of discrete derivatives for spike sorting in implantable upper-limb neural prostheses [PDF]
Next generation neural interfaces for upper-limb (and other) prostheses aim to develop implantable interfaces for one or more nerves, each interface having many neural signal channels that work reliably in the stump without harming the nerves. To achieve
Demosthenous, A +3 more
core +1 more source
Sorting has been a profound area for the algorithmic researchers and many resources are invested to suggest more works for sorting algorithms. For this purpose, many existing sorting algorithms were observed in terms of the efficiency of the algorithmic ...
NIDHAL . K EL ABBADI +1 more
doaj +1 more source
Omnidirectional-Wheel Conveyor Path Planning and Sorting Using Reinforcement Learning Algorithms
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
This thesis deals with a problem of sorting arrays, which is one of known problems in computer science. It defines concepts of sorting, algorithm and algorithm complexity.
Lýsek, Jiří
core +2 more sources
Comparison Of Hybrid Sorting Algorithms Implemented On Different Parallel Hardware Platforms
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
An asymmetric approach to preserve common intervals while sorting by reversals [PDF]
Dias Vieira Braga M, Gautier C, Sagot M-F. An asymmetric approach to preserve common intervals while sorting by reversals. Algorithms for Molecular Biology.
Braga, Marília, +6 more
core +2 more sources

