Sciweavers

6542 search results - page 21 / 1309
» The tao of parallelism in algorithms
Sort
View
SPAA
1993
ACM
14 years 27 days ago
On Gazit and Miller's Parallel Algorithm for Planar Separators: Achieving Greater Efficiency Through Random Sampling
We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.
Philip N. Klein
IRREGULAR
1995
Springer
14 years 11 days ago
Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP
In this paper, we review parallel search techniques for approximating the global optimal solution of combinatorial optimization problems. Recent developments on parallel implementa...
Panos M. Pardalos, Leonidas S. Pitsoulis, Thelma D...
PPOPP
1999
ACM
14 years 1 months ago
Basic Compiler Algorithms for Parallel Programs
Jaejin Lee, David A. Padua, Samuel P. Midkiff