Sciweavers

1338 search results - page 111 / 268
» A Secure Communications Infrastructure for High-Performance ...
Sort
View
DCOSS
2005
Springer
15 years 12 months ago
Distributed Proximity Maintenance in Ad Hoc Mobile Networks
We present an efficient distributed data structure, called the D-SPANNER, for maintaining proximity information among communicating mobile nodes. The D-SPANNER is a kinetic sparse...
Jie Gao, Leonidas J. Guibas, An Nguyen
GRID
2004
Springer
15 years 11 months ago
MARS: A Metascheduler for Distributed Resources in Campus Grids
Computational grids are increasingly being deployed in campus environments to provide unified access to distributed and heterogeneous resources such as clusters, storage arrays, ...
Abhijit Bose, Brian Wickman, Cameron Wood
APPT
2005
Springer
15 years 8 months ago
Experiments on Asynchronous Partial Gauss-Seidel Method
This paper presents design and experimental results of a parallel linear equation solver by asynchronous partial Gauss-Seidel method. The basic idea of this method is derived from ...
Hiroshi Nishida, Hairong Kuang
AUTONOMICS
2008
ACM
15 years 8 months ago
Tracking and tracing containers through distributed sensor middleware
In a container transport system, wireless sensor networks (WSNs) can be used for monitoring products while they are being transported. To be commercially interesting, these WSNs m...
Klaas Thoelen, Sam Michiels, Wouter Joosen
JPDC
2006
134views more  JPDC 2006»
15 years 6 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong