Sciweavers

57 search results - page 1 / 12
» Bead-Sort: A Natural Sorting Algorithm
Sort
View
EATCS
2002
100views more  EATCS 2002»
13 years 10 months ago
Bead-Sort: A Natural Sorting Algorithm
Nature is not only a source of minerals and precious stones but is also a mine of algorithms. By observing and studying natural phenomena, computer algorithms can be extracted. In...
Joshua J. Arulanandham, Cristian Calude, Michael J...
ISAAC
2005
Springer
113views Algorithms» more  ISAAC 2005»
14 years 4 months ago
A Simple Optimal Randomized Algorithm for Sorting on the PDM
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 ...
Sanguthevar Rajasekaran, Sandeep Sen
CEC
2007
IEEE
14 years 5 months ago
An ant-based algorithm for annular sorting
— We present an ant-based algorithm for spatially sorting objects into an annular structure. The model is minimal, as it requires only stochastic ant behaviour coupled with a phe...
Martyn Amos, Oliver Don
TC
2008
13 years 10 months ago
Optimal and Practical Algorithms for Sorting on the PDM
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 ...
Sanguthevar Rajasekaran, Sandeep Sen
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 11 months ago
Sorting and Selection with Random Costs
There is a growing body of work on sorting and selection in models other than the unit-cost comparison model. This work treats a natural stochastic variant of the problem where the...
Stanislav Angelov, Keshav Kunal, Andrew McGregor