Sciweavers

323 search results - page 46 / 65
» The Fault Tolerance of NP-Hard Problems
Sort
View
EDBT
2006
ACM
126views Database» more  EDBT 2006»
15 years 8 months ago
Replication, Load Balancing and Efficient Range Query Processing in DHTs
We consider the conflicting problems of ensuring data-access load balancing and efficiently processing range queries on peer-to-peer data networks maintained over Distributed Hash ...
Theoni Pitoura, Nikos Ntarmos, Peter Triantafillou
OPODIS
2008
15 years 7 months ago
Byzantine Consensus with Unknown Participants
Abstract. Consensus is a fundamental building block used to solve many practical problems that appear on reliable distributed systems. In spite of the fact that consensus is being ...
Eduardo Adílio Pelinson Alchieri, Alysson N...
JSW
2006
98views more  JSW 2006»
15 years 6 months ago
A Jxta Based Asynchronous Peer-to-Peer Implementation of Genetic Programming
Abstract-- Solving complex real-world problems using evolutionary computation is a CPU time-consuming task that requires a large amount of computational resources. Peerto-Peer (P2P...
Gianluigi Folino, Agostino Forestiero, Giandomenic...
TROB
2002
120views more  TROB 2002»
15 years 5 months ago
DPAC: an object-oriented distributed and parallel computing framework for manufacturing applications
Parallel and distributed computing infrastructure are increasingly being embraced in the context of manufacturing applications, including real-time scheduling. In this paper, we pr...
N. R. Srinivasa Raghavan, Tanmay Waghmare
INFOCOM
2010
IEEE
15 years 4 months ago
VBS: Maximum Lifetime Sleep Scheduling for Wireless Sensor Networks Using Virtual Backbones
—Wireless sensor network (WSN) applications require redundant sensors to guarantee fault tolerance. However, the same degree of redundancy is not necessary for multi-hop communic...
Yaxiong Zhao, Jie Wu, Feng Li, Sanglu Lu