Sciweavers

10633 search results - page 2080 / 2127
» Relating Distributed Objects
Sort
View
CIAC
2000
Springer
210views Algorithms» more  CIAC 2000»
14 years 2 months ago
Computing a Diameter-Constrained Minimum Spanning Tree in Parallel
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 ...
Narsingh Deo, Ayman Abdalla
HICSS
1999
IEEE
115views Biometrics» more  HICSS 1999»
14 years 2 months ago
Focusing on Mobility
In this paper, we motivate the importance of the field of mobile computing and survey current practical and formal approaches. We argue that the existing formalisms are not suffic...
Klaus Bergner, Radu Grosu, Andreas Rausch, Alexand...
SIGMETRICS
1999
ACM
14 years 2 months ago
Availability and Utility of Idle Memory in Workstation Clusters
In this paper, we examine the availability and utility of idle memory in workstation clusters. We attempt to answer the following questions. First, how much of the total memory in...
Anurag Acharya, Sanjeev Setia
INFOCOM
1999
IEEE
14 years 2 months ago
MTCP: Scalable TCP-like Congestion Control for Reliable Multicast
We present MTCP, a congestion control scheme for large-scale reliable multicast. Congestion control for reliable multicast is important, because of its wide applications in multim...
Injong Rhee, Nallathambi Balaguru, George N. Rousk...
SRDS
1999
IEEE
14 years 2 months ago
Formal Hazard Analysis of Hybrid Systems in cTLA
Hybrid systems like computer-controlled chemical plants are typical safety critical distributed systems. In present practice, the safety of hybrid systems is guaranteed by hazard ...
Peter Herrmann, Heiko Krumm
« Prev « First page 2080 / 2127 Last » Next »