6004 search results - page 289 / 1201 » Parallelizing query optimization |
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
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...
108
Voted
IJSIR
2010
14 years 7 months ago
2010
It is known that the most common versions of particle swarm optimization (PSO) algorithms are rotationally variant. It has also been pointed out that PSO algorithms can concentrat...
102
Voted
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
This paper demonstrates the one-sided communication used in languages like UPC can provide a significant performance advantage for bandwidth-limited applications. This is shown t...
92
Voted
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
111
Voted
PPSN
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. The paper describes an evolutionary algorithm for the general nonlinear programming problem using a surrogate model. Surrogate models are used in optimization when model ...