6105 search results - page 100 / 1221 » A Parallel Algorithm for Bound-Smoothing |
139
click to vote
IPPS
1998
IEEE
15 years 5 months ago
1998
IEEE
We present a rst randomized Ologk n time and On+m work CRCWPRAM algorithm for nding a spanning forest of an undirected dense graph with n vertices. Furthermore we construct a rando...
JPDC
2010
14 years 8 months ago
2010
We present an efficient parallel algorithm for building the separating tree for a separable permutation. Our algorithm runs in O(log2 n) time using O(n log n) operations on the CR...
ICCAD
1994
IEEE
15 years 5 months ago
1994
IEEE
We present a loosely coupled parallel algorithm for the placement of standard cell integrated circuits. Our algorithm is a derivative of simulated annealing. The implementation of...
133
click to vote
APPT
2007
Springer
15 years 3 months ago
2007
Springer
Dynamic programming is a widely applied algorithm design technique in many areas such as computational biology and scientific computing. Typical applications using this technique a...
101
click to vote
EUROPAR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. We present parallel algorithms for triangular periodic Sylvester-type matrix equations, conceptually being the third step of a periodic Bartels