Results 21 to 30 of about 216,568 (279)
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
Spin-the-bottle Sort and Annealing Sort: Oblivious Sorting via Round-robin Random Comparisons [PDF]
, 2010 We study sorting algorithms based on randomized round-robin comparisons. Specifically, we study Spin-the-bottle sort, where comparisons are unrestricted, and Annealing sort, where comparisons are restricted to a distance bounded by a \emph{temperature ...
Goodrich, Michael T.
core +2 more sources
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
Heuristic Spike Sorting Tuner (HSST), a framework to determine optimal parameter selection for a generic spike sorting algorithm [PDF]
, 2020 Extracellular microelectrodes frequently record neural activity from more than one neuron in the vicinity of the electrode. The process of labeling each recorded spike waveform with the identity of its source neuron is called spike sorting and is often ...
Bjånes, David A. +3 more
core
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
, 2008 Bakalářská práce pojednává o základních typech třídicích algoritmů. Algoritmy lze rozdělit do dvou skupin - na jednoduché (přímé) a na složitější (optimalizované).
Richter, Jan
core +2 more sources
Perbandingan Efisiensi Algoritma Sorting dalam Penggunaan Bandwidth
Ilkom Jurnal Ilmiah, 2020 The most used algorithm is the sorting algorithm. There have been many popping sorting algorithms that can be used, in this study researchers took three sorting algorithms namely Insertion Sort, Selection Sort, and Merge Sort.
Desi Anggreani +3 more
doaj +1 more source
Matrix Sort - A Parallelizable Sorting Algorithm
International Journal of Computer Applications, 2016 Sorting algorithms are the class of algorithms that result in the ordered arrangement of a list of given elements. The arrangement can be in ascending or descending order based on the requirement given. Time complexity, space complexity and optimality are used to assess the algorithms.
Saketh A., Vijay V., S. Kavitha
openaire +1 more source
AppliedMathIn the modern era of informatics, where data are very important, efficient management of data is necessary and critical. Two of the most important data management techniques are searching and data ordering (technically sorting).
Anurag Dutta +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