6105 search results - page 286 / 1221 » A Parallel Algorithm for Bound-Smoothing |
160
click to vote
WSC
2007
15 years 9 months ago
2007
The Cross-Entropy (CE) method is a modern and effective optimization method well suited to parallel implementations. There is a vast array of problems today, some of which are hig...
176
click to vote
DAGSTUHL
2008
15 years 8 months ago
2008
Abstract. A parallel version of the self-verified method for solving linear systems was presented in [19, 18]. In this research we propose improvements aiming at a better performan...
158
click to vote
WSC
2004
15 years 8 months ago
2004
In time-parallel simulation, the simulation time axis is decomposed into a number of slices which are assigned to parallel processes for concurrent simulation. Although a promisin...
177
click to vote
JDA
2008
15 years 6 months ago
2008
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case ...
186
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
This poster is a case study on the application of a novel programming model, called Concurrent Collections (CnC), to the implementation of an asynchronous-parallel algorithm for c...