Sciweavers

1830 search results - page 5 / 366
» Optimizing Sorting with Genetic Algorithms
Sort
View
IPPS
1997
IEEE
15 years 1 months ago
Optimizing Parallel Bitonic Sort
Sorting is an important component of many applications, and parallel sorting algorithms have been studied extensively in the last three decades. One of the earliest parallel sorti...
Mihai F. Ionescu
85
Voted
IPPS
2005
IEEE
15 years 3 months ago
PDM Sorting Algorithms That Take A Small Number of Passes
We live in an era of data explosion that necessitates the discovery of novel out-of-core techniques. The I/O bottleneck has to be dealt with in developing out-of-core methods. The...
Sanguthevar Rajasekaran, Sandeep Sen
IAJIT
2010
179views more  IAJIT 2010»
14 years 8 months ago
Enhanced Quicksort Algorithm
: Sorting is considered as one of the important issues of computer science. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal of res...
Rami Mansi
72
Voted
GECCO
2005
Springer
155views Optimization» more  GECCO 2005»
15 years 3 months ago
Mission planning for joint suppression of enemy air defenses using a genetic algorithm
In this paper we present a genetic algorithm applied to the problem of mission planning for Joint Suppression of Enemy Air Defenses (JSEAD) in support of air strike operations. Th...
Jeffrey P. Ridder, Jason C. HandUber
IPPS
2006
IEEE
15 years 3 months ago
GPU-ABiSort: optimal parallel sorting on stream architectures
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p strea...
Alexander Greß, Gabriel Zachmann