4315 search results - page 12 / 863 » Sorting in linear time |
CPM
2004
Springer
14 years 26 days ago
2004
Springer
Abstract. We consider the problem of sorting linear and circular permutations and 0/1 sequences by reversals in a length-sensitive cost model. We extend the results on sorting by l...
SBACPAD
2004
IEEE
13 years 8 months ago
2004
IEEE
The aim of the paper is to introduce techniques in order to optimize the parallel execution time of sorting on heterogeneous platforms (processors speeds are related by a constant...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
A new fast (real time) sorter of binary numbers by one-dimensional cellular automata is proposed. It sorts a list of n numbers represented by k-bits each in exactly nk steps. This ...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The aim of the paper is to introduce general techniques in order to optimize the parallel execution time of sorting on a distributed architectures with processors of various speeds...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In many industrial applications, the dynamic control of queuing and routing presents difficult challenges. We describe a novel ant colony control system for a multiobjective sorti...