Sciweavers

739 search results - page 48 / 148
» Sorting Algorithms
Sort
View
ICDE
2007
IEEE
113views Database» more  ICDE 2007»
14 years 10 months ago
Reducing Order Enforcement Cost in Complex Query Plans
Algorithms that exploit sort orders are widely used to implement joins, grouping, duplicate elimination and other set operations. Query optimizers traditionally deal with sort ord...
Ravindra Guravannavar, S. Sudarshan
ICALP
1992
Springer
14 years 26 days ago
Fast Integer Merging on the EREW PRAM
Abstract. We investigate the complexity of merging sequences of small integers on the EREW PRAM. Our most surprising result is that two sorted sequences of n bits each can be merge...
Torben Hagerup
SIGCSE
2002
ACM
123views Education» more  SIGCSE 2002»
13 years 8 months ago
Algorithms and object-oriented programming: bridging the gap
Currently there is a serious conceptual and technical gap between ideas emphasized in object-oriented programming and ideas as taught in algorithms courses. We suggest both a para...
Paolo Bucci, Wayne D. Heym, Timothy J. Long, Bruce...
TEC
2002
161views more  TEC 2002»
13 years 8 months ago
A fast and elitist multiobjective genetic algorithm: NSGA-II
Multiobjective evolutionary algorithms (EAs) that use nondominated sorting and sharing have been criticized mainly for their: 1) ( 3) computational complexity (where is the number ...
Kalyanmoy Deb, Samir Agrawal, Amrit Pratap, T. Mey...
IPPS
1998
IEEE
14 years 1 months ago
Randomized Algorithms on the Mesh
The mesh-connected array is an attractive architecture for parallel machines, and a number of existing parallel machines are based on a mesh topology. In this paper, we survey the ...
Lata Narayanan