Results 1  10
of
5,366
The Bitonic Sort on Transputer Architectures
, 1991
"... The bitonic sort algorithm is a parallel sorting algorithm that has been implemented in sorting networks and is readily adaptable to Transputer arrays. This paper looks at the implementation and time cost of the algorithm for machine and compares this with an implementation on T8 networks to see the ..."
Abstract
 Add to MetaCart
The bitonic sort algorithm is a parallel sorting algorithm that has been implemented in sorting networks and is readily adaptable to Transputer arrays. This paper looks at the implementation and time cost of the algorithm for machine and compares this with an implementation on T8 networks to see
A blocksorting lossless data compression algorithm
, 1994
"... We describe a blocksorting, lossless data compression algorithm, and our implementation of that algorithm. We compare the performance of our implementation with widely available data compressors running on the same hardware. The algorithm works by applying a reversible transformation to a block o ..."
Abstract

Cited by 809 (5 self)
 Add to MetaCart
We describe a blocksorting, lossless data compression algorithm, and our implementation of that algorithm. We compare the performance of our implementation with widely available data compressors running on the same hardware. The algorithm works by applying a reversible transformation to a block
Multiobjective Optimization Using Nondominated Sorting in Genetic Algorithms
 Evolutionary Computation
, 1994
"... In trying to solve multiobjective optimization problems, many traditional methods scalarize the objective vector into a single objective. In those cases, the obtained solution is highly sensitive to the weight vector used in the scalarization process and demands the user to have knowledge about t ..."
Abstract

Cited by 539 (5 self)
 Add to MetaCart
the underlying problem. Moreover, in solving multiobjective problems, designers may be interested in a set of Paretooptimal points, instead of a single point. Since genetic algorithms(GAs) work with a population of points, it seems natural to use GAs in multiobjective optimization problems to capture a
A Fast Elitist NonDominated Sorting Genetic Algorithm for MultiObjective Optimization: NSGAII
, 2000
"... Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) 4 computational complexity (where is the number of objectives and is the population size), (ii) nonelitism approach, and (iii) the need for specifying a sharing ..."
Abstract

Cited by 662 (15 self)
 Add to MetaCart
Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) 4 computational complexity (where is the number of objectives and is the population size), (ii) nonelitism approach, and (iii) the need for specifying a
Optimal Aggregation Algorithms for Middleware
 IN PODS
, 2001
"... Assume that each object in a database has m grades, or scores, one for each of m attributes. For example, an object can have a color grade, that tells how red it is, and a shape grade, that tells how round it is. For each attribute, there is a sorted list, which lists each object and its grade under ..."
Abstract

Cited by 717 (4 self)
 Add to MetaCart
under that attribute, sorted by grade (highest grade first). There is some monotone aggregation function, or combining rule, such as min or average, that combines the individual grades to obtain an overall grade. To determine the top k objects (that have the best overall grades), the naive algorithm
Abstract Efficient Bitonic Sorting of Large Arrays on the MasPar MP1†
"... The problem of sorting a collection of values on a meshconnected distributedmemory SIMD computer using variants of Batcher's Bitonic sort algorithm is considered for the case where the number of values exceeds the number of processors in the machine. In this setting the number of comparisons ..."
Abstract
 Add to MetaCart
The problem of sorting a collection of values on a meshconnected distributedmemory SIMD computer using variants of Batcher's Bitonic sort algorithm is considered for the case where the number of values exceeds the number of processors in the machine. In this setting the number of comparisons
Bitonic Sort on Ultracomputers
, 1979
"... Batcher's bitonic sort (cf. Knuth, v. III, pp. 232 ff) is a sorting network, capable of sorting n inputs in Q((log n) 2 ) stages. When adapted to conventional computers, it gives rise to an algorithm that runs in time Q(n(log n) 2 ). The method can also be adapted to ultracomputers (Schwar ..."
Abstract
 Add to MetaCart
Batcher's bitonic sort (cf. Knuth, v. III, pp. 232 ff) is a sorting network, capable of sorting n inputs in Q((log n) 2 ) stages. When adapted to conventional computers, it gives rise to an algorithm that runs in time Q(n(log n) 2 ). The method can also be adapted to ultracomputers
A Fast and Elitist MultiObjective Genetic Algorithm: NSGAII
, 2000
"... Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) O(MN computational complexity (where M is the number of objectives and N is the population size), (ii) nonelitism approach, and (iii) the need for specifying a sharing param ..."
Abstract

Cited by 1815 (60 self)
 Add to MetaCart
Multiobjective evolutionary algorithms which use nondominated sorting and sharing have been mainly criticized for their (i) O(MN computational complexity (where M is the number of objectives and N is the population size), (ii) nonelitism approach, and (iii) the need for specifying a sharing
Simulating the Bitonic Sort on a 2Dmesh with P Systems
"... Summary. This paper gives a version of the parallel bitonic sorting algorithm of Batcher, which can sort N elements in time O(log 2 N). When applying it to the 2D mesh architecture, two indexing functions are considered, rowmajor and shuffled rowmajor. Some properties are proved for the later, toge ..."
Abstract
 Add to MetaCart
Summary. This paper gives a version of the parallel bitonic sorting algorithm of Batcher, which can sort N elements in time O(log 2 N). When applying it to the 2D mesh architecture, two indexing functions are considered, rowmajor and shuffled rowmajor. Some properties are proved for the later
Results 1  10
of
5,366