1830 search results - page 7 / 366 » Optimizing Sorting with Genetic Algorithms |
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
IEEEPACT
2007
IEEE
15 years 3 months ago
2007
IEEE
Many sorting algorithms have been studied in the past, but there are only a few algorithms that can effectively exploit both SIMD instructions and threadlevel parallelism. In this...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Evolutionary multi-objective optimization (EMO) methodologies, suggested in the beginning of Nineties, focussed on the task of finding a set of well-converged and well-distribute...
ICAPR
2005
Springer
15 years 3 months ago
2005
Springer
A non-dominated sorting genetic algorithm is used to evolve models of learning from different theories for multiple tasks. Correlation analysis is performed to identify parameters...
73
Voted
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...