Sciweavers

515 search results - page 25 / 103
» Neighborhood operator systems and approximations
Sort
View
RANDOM
1998
Springer
15 years 1 months ago
Using Approximation Hardness to Achieve Dependable Computation
Abstract. Redundancy has been utilized to achieve fault tolerant computation and to achieve reliable communication in networks of processors. These techniques can only be extended ...
Mike Burmester, Yvo Desmedt, Yongge Wang
FLAIRS
2004
14 years 11 months ago
Physical Approximations for Urban Fire Spread Simulations
The issue of fire propagation in cities is of obvious importance to Civil Authorities, but does present issues of computational complexity. Our basic assumption is that some event...
Daniel J. Bertinshaw, Hans W. Guesgen
125
Voted
ECRTS
2005
IEEE
15 years 3 months ago
Speed Modulation in Energy-Aware Real-Time Systems
This paper presents a general framework for analyzing and designing embedded systems with energy and timing requirements. A set of realistic assumptions is considered in the model...
Enrico Bini, Giorgio C. Buttazzo, Giuseppe Lipari
93
Voted
DSN
2006
IEEE
15 years 1 months ago
Empirical and Analytical Evaluation of Systems with Multiple Unreliable Servers
We construct, analyze and solve models of systems where a number of servers offer services to an incoming stream of demands. Each server goes through alternating periods of being ...
Jennie Palmer, Isi Mitrani
EWSN
2011
Springer
14 years 1 months ago
The Announcement Layer: Beacon Coordination for the Sensornet Stack
Sensornet protocols periodically broadcast beacons for neighborhood information advertisement, but beacon transmissions are costly when power-saving radio duty cycling mechanisms a...
Adam Dunkels, Luca Mottola, Nicolas Tsiftes, Fredr...