334 search results - page 46 / 67 » Practical Parallel Algorithms for Minimum Spanning Trees |
119
click to vote
ISPD
1997
ACM
15 years 1 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...
IPPS
2010
IEEE
14 years 7 months ago
2010
IEEE
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
CGF
2000
14 years 9 months ago
2000
In this paper, we propose a novel external-memory algorithm to support view-dependent simplification for datasets much larger than main memory. In the preprocessing phase, we use ...
105
click to vote
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
We introduce a new model for distributed algorithms designed for large scale systems that need a low-overhead solution to allow the processes to communicate with each other. We as...
EH
2005
IEEE
15 years 3 months ago
2005
IEEE
In this paper we describe novel metrics measuring complexity in self-organising networks. The metrics are investigated within the context of decentralised inspections, developed a...