Sciweavers

3686 search results - page 113 / 738
» Pattern-Based Parallel Programming
Sort
View
SIAMCOMP
1998
137views more  SIAMCOMP 1998»
14 years 9 months ago
Primal-Dual RNC Approximation Algorithms for Set Cover and Covering Integer Programs
We build on the classical greedy sequential set cover algorithm, in the spirit of the primal-dual schema, to obtain simple parallel approximation algorithms for the set cover probl...
Sridhar Rajagopalan, Vijay V. Vazirani
COR
2011
14 years 1 months ago
Sampled fictitious play for approximate dynamic programming
Marina A. Epelman, Archis Ghate, Robert L. Smith
SCP
2000
135views more  SCP 2000»
14 years 9 months ago
A calculus of functional BSP programs
An extension of the -calculus called BS is introduced as a formal basis for functional languages expressing bulk synchronous parallel algorithms. A con uence result is shown. The ...
Frédéric Loulergue, Gaétan Ha...
SPAA
1995
ACM
15 years 1 months ago
Provably Efficient Scheduling for Languages with Fine-Grained Parallelism
Many high-level parallel programming languages allow for fine-grained parallelism. As in the popular work-time framework for parallel algorithm design, programs written in such lan...
Guy E. Blelloch, Phillip B. Gibbons, Yossi Matias
CG
2008
Springer
14 years 11 months ago
Parallel Monte-Carlo Tree Search
Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the stren...
Guillaume Chaslot, Mark H. M. Winands, H. Jaap van...