Sciweavers

9631 search results - page 273 / 1927
» The Costs of Using JXTA
Sort
View
INFOCOM
2012
IEEE
13 years 9 months ago
Experimental performance comparison of Byzantine Fault-Tolerant protocols for data centers
Abstract—In this paper, we implement and evaluate three different Byzantine Fault-Tolerant (BFT) state machine replication protocols for data centers: (1) BASIC: The classic solu...
Guanfeng Liang, Benjamin Sommer, Nitin H. Vaidya
INFOCOM
2012
IEEE
13 years 9 months ago
Spectrum mobility games
Cognitive radio gives users the ability to switch channels and make use of dynamic spectral opportunities. However, switching channels takes time, and may disrupt the quality of a...
Richard Southwell, Jianwei Huang, Xin Liu
ESA
2003
Springer
99views Algorithms» more  ESA 2003»
16 years 7 hour ago
Adversary Immune Leader Election in ad hoc Radio Networks
Abstract. Recently, efficient leader election algorithms for ad hoc radio networks with low time complexity and energy cost have been designed even for the no-collision detection,...
Miroslaw Kutylowski, Wojciech Rutkowski
APPROX
2000
Springer
190views Algorithms» more  APPROX 2000»
15 years 11 months ago
Approximating node connectivity problems via set covers
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
Guy Kortsarz, Zeev Nutov
GLVLSI
2009
IEEE
125views VLSI» more  GLVLSI 2009»
16 years 1 months ago
Timing-driven N-way decomposition
Logic decomposition has been extensively used to optimize the worst-case delay and the area in the technology independent phase. Bi-decomposition is one of the state-of-art techni...
David Bañeres, Jordi Cortadella, Michael Ki...