400 search results - page 42 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
IJAIT
2007
14 years 11 months ago
2007
In this paper, we study the unrelated parallel machine problem for minimizing the makespan, which is NP-hard. We used Simulated Annealing (SA) and Tabu Search (TS) with Neighborho...
TPDS
1998
14 years 11 months ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
CORR
2002
Springer
14 years 11 months ago
2002
Springer
An algorithm M is described that solves any well-defined problem p as quickly as the fastest algorithm computing a solution to p, save for a factor of 5 and loworder additive term...
ICDM
2005
IEEE
15 years 5 months ago
2005
IEEE
This paper presents the triple jump framework for accelerating the EM algorithm and other bound optimization methods. The idea is to extrapolate the third search point based on th...
116
click to vote
ICDCS
2005
IEEE
15 years 5 months ago
2005
IEEE
Communication-induced checkpointing protocols that ensure rollback-dependency trackability (RDT) guarantee important properties to the recovery system without explicit coordinatio...