Sciweavers

49 search results - page 6 / 10
» A parallel algorithmic version of the Local Lemma
Sort
View
SIAMCOMP
2010
147views more  SIAMCOMP 2010»
14 years 8 months ago
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
The classical direct product theorem for circuits says that if a Boolean function f : {0, 1}n → {0, 1} is somewhat hard to compute on average by small circuits, then the correspo...
Russell Impagliazzo, Ragesh Jaiswal, Valentine Kab...
CGF
2008
173views more  CGF 2008»
14 years 9 months ago
A Local/Global Approach to Mesh Parameterization
We present a novel approach to parameterize a mesh with disk topology to the plane in a shape-preserving manner. Our key contribution is a local/global algorithm, which combines a...
Ligang Liu, Lei Zhang, Yin Xu, Craig Gotsman, Stev...
IPPS
1998
IEEE
15 years 1 months ago
Predicting the Running Times of Parallel Programs by Simulation
Predicting the running time of a parallel program is useful for determining the optimal values for the parameters of the implementation and the optimal mapping of data on processo...
Radu Rugina, Klaus E. Schauser
PPSC
1989
14 years 10 months ago
Evaluating Block Algorithm Variants in LAPACK
The LAPACK software project currently under development is intended to provide a portable linear algebra library for high performance computers. LAPACK will make use of the Level 1...
Ed Anderson, Jack Dongarra
COR
2010
119views more  COR 2010»
14 years 9 months ago
Algorithms for a realistic variant of flowshop scheduling
This paper deals with a realistic variant of flowshop scheduling, namely the hybrid flexible flowshop. A hybrid flowshop mixes the characteristics of regular flowshops and paralle...
B. Naderi, Rubén Ruiz, M. Zandieh