6105 search results - page 260 / 1221 » A Parallel Algorithm for Bound-Smoothing |
199
click to vote
ESCIENCE
2007
IEEE
15 years 10 months ago
2007
IEEE
Abstract. We study the implementation on grid systems of an efficient algorithm for demanding global optimization problems. Specifically, we consider problems arising in the geneti...
280
click to vote
WAE
2001
15 years 8 months ago
2001
The ability to provide uniform shared-memory access to a significant number of processors in a single SMP node brings us much closer to the ideal PRAM parallel computer. In this pa...
151
click to vote
EGH
2009
Springer
15 years 4 months ago
2009
Springer
Current GPUs rasterize micropolygons (polygons approximately one pixel in size) inefficiently. We design and analyze the costs of three alternative data-parallel algorithms for ra...
147
click to vote
ICPPW
2005
IEEE
16 years 7 days ago
2005
IEEE
Large–scale parallel applications performing global synchronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Conseque...
180
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
For any xed dimension d, the linear programming problem with n inequality constraints can be solved on a probabilistic CRCW PRAM with O(n) processors almost surely in constant time...