36 search results - page 1 / 8 » A Parallel Algorithm for Minimum Cost Path Computation on Po... |
IPPS
1998
IEEE
13 years 8 months ago
1998
IEEE
This paper describes a new parallel algorithm for Minimum Cost Path computation on the Polymorphic Processor Array, a massively parallel architecture based on a reconfigurable mesh...
ISPAN
2005
IEEE
13 years 10 months ago
2005
IEEE
Abstract—In real networks, disjoint paths are needed for providing protection against single link/node failure. When disjoint paths cannot be found, an alternative solution is to...
CIAC
2000
Springer
13 years 8 months ago
2000
Springer
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to ...
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
13 years 4 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
IPPS
2006
IEEE
13 years 10 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...