Sciweavers

209 search results - page 27 / 42
» Computing a Diameter-Constrained Minimum Spanning Tree in Pa...
Sort
View
DAC
1989
ACM
15 years 1 months ago
A New Approach to the Rectilinear Steiner Tree Problem
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
Jan-Ming Ho, Gopalakrishnan Vijayan, C. K. Wong
PODC
2003
ACM
15 years 2 months ago
Adapting to a reliable network path
We consider the model of unreliable network links, where at each time unit a link might be either up or down. We consider two related problems. The first, establishing end to end...
Baruch Awerbuch, Yishay Mansour
PODC
1990
ACM
15 years 1 months ago
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
Shlomi Dolev, Amos Israeli, Shlomo Moran

Lecture Notes
443views
16 years 7 months ago
Design and Analysis of Computer Algorithms
"This course will consist of a number of major sections. The first will be a short review of some preliminary material, including asymptotics, summations, and recurrences and ...
David M. Mount
PDPTA
2007
14 years 11 months ago
Two Graph Algorithms On an Associative Computing Model
- The MASC (for Multiple Associative Computing) model is a SIMD model enhanced with associative properties and multiple synchronous instruction streams (IS). A number of algorithms...
Mingxian Jin, Johnnie W. Baker