1185 search results - page 114 / 237 » An Improved Parallel Thinning Algorithm |
124
click to vote
PPSN
2010
Springer
14 years 7 months ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
104
click to vote
CGO
2009
IEEE
15 years 1 months ago
2009
IEEE
Effectively migrating sequential applications to take advantage of parallelism available on multicore platforms is a well-recognized challenge. This paper addresses important aspec...
HPCC
2011
Springer
13 years 9 months ago
2011
Springer
— Mapping of parallel applications on the network topology is becoming increasingly important on large supercomputers. Topology aware mapping can reduce the hops traveled by mess...
PPSN
2004
Springer
15 years 3 months ago
2004
Springer
We show how the understandability and speed of genetic programming classification algorithms can be improved, without affecting the classification accuracy. By analyzing the dec...
EUROPAR
2001
Springer
15 years 2 months ago
2001
Springer
For the solution of the SID (Symmetric InDefinite) linear systems, the use of the GLS (Generalized Least-Squares) polynomial preconditioner can improve the execution efficiency of...