Sciweavers

739 search results - page 12 / 148
» Sorting Algorithms
Sort
View
IPPS
1997
IEEE
13 years 11 months ago
Work-Time Optimal K-Merge Algorithms on the PRAM
The k-merge problem, given a collection of k, (2  k  n), sorted sequences of total length n, asks to merge them into a new sorted sequence. The main contribution of this work is...
Tatsuya Hayashi, Koji Nakano, Stephan Olariu
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
14 years 26 days ago
A Cooperative Coevolutionary Multiobjective Algorithm Using Non-dominated Sorting
The following paper describes a cooperative coevolutionary algorithm which incorporates a novel collaboration formation mechanism. It encourages rewarding of components participati...
Antony W. Iorio, Xiaodong Li
ALGORITHMICA
2000
72views more  ALGORITHMICA 2000»
13 years 7 months ago
Sorting-Based Selection Algorithms for Hypercubic Networks
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based ...
Pascal Berthomé, Afonso Ferreira, Bruce M. ...
ALGORITHMICA
2006
86views more  ALGORITHMICA 2006»
13 years 7 months ago
Slabpose Columnsort: A New Oblivious Algorithm for Out-of-Core Sorting on Distributed-Memory Clusters
Our goal is to develop a robust out-of-core sorting program for a distributed-memory cluster. The literature contains two dominant paradigms for out-of-core sorting algorithms: me...
Geeta Chaudhry, Thomas H. Cormen
SPIRE
2005
Springer
14 years 29 days ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger