the BMI Eigenvalue Problem is one of optimization problems and is to minimize the greatest eigenvalue or a bilinear matrix function. this paper proposes a parallel algorithm to compute the ϵ-optimal solution of the BM...
Wireless sensor networks withthousands of tiny sensor nodes, are expected to find wide applicability and increasing deployment in coming years, as they enable reliable monitoring and analysis of the environment. In t...
the last thirty years have seen trmendous growth in research in mobile telemcommunications. However, interest in mobile computing, which includes mobile telephony and more, has increased over the last ten years. Never...
An algorithm for parallelprocessingthe discrete nonlinear system for solving Fredholm integro-differential equations with two-point boundary conditions on a PC cluster is considered. the cost of calculating the hist...
详细信息
作者：
Meyer, U.
Stuhlsatzenhausweg 85 Saarbrücken66123 Germany
We study the average-case complexity of the parallel single-source shortest path (SSSP) problem, assuming arbitrary directed graphs with n nodes, m edges, and independent random edge weights uniformly distributed in [...
A consequence of the increasing popularity of Beowulf clusters has been their increasing size (in number of nodes). Yet, the hard drives available on these nodes are only used for the system and temporary files, thus ...
Genetic Algorithms, originally inspired by the nature, have come a long a way in the past decade to establish itself as a numerical optimization tool of choice. the simplicity of its structure, robustness of its opera...
Object-oriented programming, design patterns, and frameworks are common techniques that have been used to reduce the complexity of sequential programming. We have applied these techniques to the more difficult domain ...
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 implemented on distributed memory computers has...
this paper proposes a new distributed shortest path (SP) based delay constrained multicast routing algorithm which is capable of constructing a delay constrained multicast tree when node,failures occur during the tree...
暂无评论