Sciweavers

6506 search results - page 489 / 1302
» Algorithmic models for sensor networks
Sort
View
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
16 years 7 months ago
The Price of Validity in Dynamic Networks
Massive-scale self-administered networks like Peer-to-Peer and Sensor Networks have data distributed across thousands of participant hosts. These networks are highly dynamic with ...
Mayank Bawa, Aristides Gionis, Hector Garcia-Molin...
DFG
2009
Springer
16 years 1 months ago
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz,...
SPIN
2000
Springer
15 years 10 months ago
Modeling the ASCB-D Synchronization Algorithm with SPIN: A Case Study
In this paper, we describe our application of SPIN 1 to model an algorithm used to synchronize the clocks of modules that provide periodic real-time communication over a network. W...
Nicholas Weininger, Darren D. Cofer
FGCS
2006
83views more  FGCS 2006»
15 years 6 months ago
Memory-efficient Kronecker algorithms with applications to the modelling of parallel systems
We present a new algorithm for computing the solution of large Markov chain models whose generators can be represented in the form of a generalized tensor algebra, such as network...
Anne Benoit, Brigitte Plateau, William J. Stewart
STOC
1994
ACM
108views Algorithms» more  STOC 1994»
15 years 11 months ago
Pseudorandomness for network algorithms
We define pseudorandom generators for Yao's twoparty communication complexity model and exhibit a simple construction, based on expanders, for it. We then use a recursive com...
Russell Impagliazzo, Noam Nisan, Avi Wigderson