48 search results - page 6 / 10 » A Parallel Algorithm for Relational Coarsest Partition Probl... |
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Parallel programming is elusive. The relative performance of di erent parallel implementations varies with machine architecture, system and problem size. How to compare di erent i...
CP
2010
Springer
13 years 5 months ago
2010
Springer
We introduce a parallelized version of tree-decomposition based dynamic programming for solving difficult weighted CSP instances on many cores. A tree decomposition organizes cost ...
LCTRTS
2009
Springer
14 years 2 months ago
2009
Springer
The StreamIt programming model has been proposed to exploit parallelism in streaming applications on general purpose multicore architectures. The StreamIt graphs describe task, da...
DASFAA
2003
IEEE
14 years 28 days ago
2003
IEEE
Approximate string matching on large DNA sequences data is very important in bioinformatics. Some studies have shown that suffix tree is an efficient data structure for approxim...
GECCO
2010
Springer
13 years 11 months ago
2010
Springer
The island model for evolutionary algorithms allows to delay the global convergence of the evolution process and encourage diversity. However, solving large size and time-intensiv...