Computer systems have increased the volume of digital data in nearly every sector.
However, many digital data have also created a problem in their management, one of the …

Quick Sort is considered as the fastest sorting algorithm among all the sorting algorithms.
The idea of selecting a pivot was introduced in classical Quick Sort in 1962. This sorting …

Sorting is the basic operation in most of the applications of computer science. Sorting means
to arrange data in particular order inside computer. In this paper we have discussed …

Wireless Snesor Network (WSN) based systems with a focus on Internet of Things (IoT)
applications generate a large amount of data. Many applications that need to process data …

The Machine‐Part Cell Formation Problem (MPCFP) is a NP‐Hard optimization problem that
consists in grouping machines and parts in a set of cells, so that each cell can operate …

Splitter-based parallel sorting algorithms are known to be highly efficient for distributed
sorting due to their low communication complexity. Although using GPU accelerators could …

Many sorting algorithms have been proposed and implemented in previous years. These
algorithms are usually judged by their performance in term of algorithm growth rate …

The Sorting can be of two ways first is sequential sorting and second is parallel sorting. Now
a day's it is not a good idea to do the sorting of data sequentially as in the present life we …

Предлагается метод интеллектуального анализа тональности текстов TextJSM,
основанный на ДСМ-методе автоматического порождения гипотез. Представлены два …

In this article, an upgraded version of CUDA-Quicksort-an iterative implementation of the
quicksort algorithm suitable for highly parallel multicore graphics processors, is described …