Sciweavers

739 search results - page 57 / 148
» Sorting Algorithms
Sort
View
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
13 years 11 months ago
Rotated test problems for assessing the performance of multi-objective optimization algorithms
This paper presents four rotatable multi-objective test problems that are designed for testing EMO (Evolutionary Multiobjective Optimization) algorithms on their ability in dealin...
Antony W. Iorio, Xiaodong Li
SIAMCOMP
1998
168views more  SIAMCOMP 1998»
13 years 7 months ago
Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
This paper first presents a unified approach to design efficient algorithms for the weighted domination problem and its three variants, i.e., the weighted independent, connected,...
Maw-Shang Chang
GECCO
2006
Springer
134views Optimization» more  GECCO 2006»
13 years 11 months ago
Incorporating directional information within a differential evolution algorithm for multi-objective optimization
The field of Differential Evolution (DE) has demonstrated important advantages in single objective optimization. To date, no previous research has explored how the unique characte...
Antony W. Iorio, Xiaodong Li
CPM
2008
Springer
112views Combinatorics» more  CPM 2008»
13 years 9 months ago
Computing Inverse ST in Linear Complexity
The Sort Transform (ST) can significantly speed up the block sorting phase of the Burrows-Wheeler transform (BWT) by sorting only limited order contexts. However, the best result o...
Ge Nong, Sen Zhang, Wai Hong Chan
FCT
2001
Springer
14 years 7 days ago
Best Increments for the Average Case of Shellsort
This paper presents the results of using sequential analysis to find increment sequences that minimize the average running time of Shellsort, for array sizes up to several thousan...
Marcin Ciura