549 search results - page 16 / 110 » Computing All the Best Swap Edges Distributively |
WEA
2010
Springer
15 years 4 months ago
2010
Springer
We successfully contract timetable networks with realistic transfer times. Contraction gradually removes nodes from the graph and adds shortcuts to preserve shortest paths. This r...
IEEEPACT
2008
IEEE
15 years 4 months ago
2008
IEEE
Communication overheads are one of the fundamental challenges in a multiprocessor system. As the number of processors on a chip increases, communication overheads and the distribu...
101
click to vote
CCGRID
2008
IEEE
14 years 11 months ago
2008
IEEE
This paper examines the job exchange between parallel compute sites in a decentralized Grid scenario. Here, the local scheduling system remains untouched and continues normal oper...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
61
Voted
IPPS
1999
IEEE
15 years 1 months ago
1999
IEEE
We present practical parallel algorithms using prefix computations for various problems that arise in pairwise comparison of biological sequences. We consider both constant and af...