Sciweavers

323 search results - page 59 / 65
» The Fault Tolerance of NP-Hard Problems
Sort
View
RANDOM
1998
Springer
15 years 4 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
ASPLOS
2010
ACM
15 years 7 months ago
Power routing: dynamic power provisioning in the data center
Data center power infrastructure incurs massive capital costs, which typically exceed energy costs over the life of the facility. To squeeze maximum value from the infrastructure,...
Steven Pelley, David Meisner, Pooya Zandevakili, T...
ICNP
2003
IEEE
15 years 5 months ago
Data Dissemination with Ring-Based Index for Wireless Sensor Networks
In current sensor networks, sensor nodes are capable of not only measuring real world phenomena, but also storing, processing and transferring these measurements. Many data dissem...
Wensheng Zhang, Guohong Cao, Thomas F. La Porta
IPPS
2007
IEEE
15 years 6 months ago
Achieving Reliable Parallel Performance in a VoD Storage Server Using Randomization and Replication
This paper investigates randomization and replication as strategies to achieve reliable performance in disk arrays targeted for video-on-demand (VoD) workloads. A disk array can p...
Yung Ryn Choe, Vijay S. Pai
91
Voted
INFOCOM
2005
IEEE
15 years 6 months ago
Provably competitive adaptive routing
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...
Baruch Awerbuch, David Holmer, Herbert Rubens, Rob...