400 search results - page 5 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
EVOW
2007
Springer
15 years 3 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
71
Voted
EVOW
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. Motivated by parallel optimization, we study the SelfAdaptation algorithm for large population sizes. We first show that the current version of this algorithm does not r...
GCC
2003
Springer
15 years 2 months ago
2003
Springer
ICPP
1998
IEEE
15 years 1 months ago
1998
IEEE
The crew planning problem has been successfully solved on a loosely connected network of workstations (NOW) using advanced computational techniques and efficient communication pat...
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
Sort can be speeded up on parallel computers by dividing and computing data individually in parallel. Merge sort can be parallelized, however, the conventional algorithm implement...