1073 search results - page 53 / 215 » ParaDisEO-Based Design of Parallel and Distributed Evolution... |
JPDC
2006
13 years 9 months ago
2006
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
IPPS
2007
IEEE
14 years 3 months ago
2007
IEEE
Resource performance in the Computational Grid is not only heterogeneous, but also changing dynamically. However scheduling algorithms designed for traditional parallel and distri...
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
Classical mesh partitioning algorithms were designed for rather static situations, and their straightforward application in a dynamical framework may lead to unsatisfactory result...
PARA
1994
Springer
14 years 1 months ago
1994
Springer
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
RECOMB
2004
Springer
14 years 9 months ago
2004
Springer
In nature, one finds large collections of different protein sequences exhibiting roughly the same three-dimensional structure, and this observation underpins the study of structur...