Sciweavers

80 search results - page 1 / 16
» Optimizing Sort in Hadoop Using Replacement Selection
Sort
View
PVLDB
2010
112views more  PVLDB 2010»
13 years 9 months ago
Two-way Replacement Selection
The performance of external sorting using merge sort is highly dependent on the length of the runs generated. One of the most commonly used run generation strategies is Replacemen...
Xavier Martinez-Palau, David Dominguez-Sal, Josep-...
IAJIT
2010
115views more  IAJIT 2010»
13 years 9 months ago
An Enhancement of Major Sorting Algorithms
: One of the fundamental issues in computer science is ordering a list of items. Although there is a huge number of sorting algorithms, sorting problem has attracted a great deal o...
Jehad Alnihoud, Rami Mansi
GECCO
2003
Springer
245views Optimization» more  GECCO 2003»
14 years 4 months ago
A Non-dominated Sorting Particle Swarm Optimizer for Multiobjective Optimization
Abstract. This paper introduces a modified PSO, Non-dominated Sorting Particle Swarm Optimizer (NSPSO), for better multiobjective optimization. NSPSO extends the basic form of PSO...
Xiaodong Li
AIR
2005
98views more  AIR 2005»
13 years 10 months ago
Evolving Dynamic Multi-Objective Optimization Problems with Objective Replacement
This paper studies the strategies for multi-objective optimization in a dynamic environment. In particular, we focus on problems with objective replacement, where some objectives ...
Sheng Uei Guan, Qian Chen, Wenting Mo
CORR
2007
Springer
82views Education» more  CORR 2007»
13 years 10 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