8125 search results - page 254 / 1625 » Parallelism and evolutionary algorithms |
168
click to vote
IPPS
1998
IEEE
15 years 8 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...
103
click to vote
JPDC
2010
14 years 11 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...
155
Voted
PLDI
2011
ACM
14 years 7 months ago
2011
ACM
For more than thirty years, the parallel programming community has used the dependence graph as the main abstraction for reasoning about and exploiting parallelism in “regularâ€...
116
click to vote
ICCAD
1994
IEEE
15 years 8 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...
155
Voted
APPT
2007
Springer
15 years 5 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...