Sciweavers

6897 search results - page 359 / 1380
» Parallelization of Modular Algorithms
Sort
View
IPCO
1998
152views Optimization» more  IPCO 1998»
15 years 8 months ago
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
Alix Munier, Maurice Queyranne, Andreas S. Schulz
MOR
2000
90views more  MOR 2000»
15 years 6 months ago
A PTAS for Minimizing the Total Weighted Completion Time on Identical Parallel Machines
We consider the problem of scheduling a set of n jobs on m identical parallel machines so as to minimize the weighted sum of job completion times. This problem is NP-hard in the s...
Martin Skutella, Gerhard J. Woeginger
PC
2000
100views Management» more  PC 2000»
15 years 6 months ago
Trading accuracy for speed in parallel simulated annealing with simultaneous moves
A common approach to parallelizing simulated annealing to generate several perturbations to the current solution simultaneously, requiring synchronization to guarantee correct eva...
M. D. Durand, Steve R. White
CP
2005
Springer
16 years 12 days ago
Parallel Local Search in Comet
Abstract. The availability of commodity multiprocessors offers significant opportunities for addressing the increasing computational requirements of optimization applications. To...
Laurent Michel, Pascal Van Hentenryck
EUROPAR
2006
Springer
15 years 10 months ago
Surrounding Theorem: Developing Parallel Programs for Matrix-Convolutions
Computations on two-dimensional arrays such as matrices and images are one of the most fundamental and ubiquitous things in computational science and its vast application areas, bu...
Kento Emoto, Kiminori Matsuzaki, Zhenjiang Hu, Mas...