Sciweavers

4781 search results - page 131 / 957
» Online algorithms for network design
Sort
View
INFOCOM
1999
IEEE
15 years 5 months ago
A Rearrangeable Algorithm for the Construction of Delay-Constrained Dynamic Multicast Trees
With the proliferationof multimediagroup applications, the construction of multicast trees satisfying Qualityof ServiceQoS requirementsis becominga problemof prime importance. Man...
R. Sriram, G. Manimaran, C. Siva Ram Murthy
APPROX
2004
Springer
119views Algorithms» more  APPROX 2004»
15 years 7 months ago
Cost-Sharing Mechanisms for Network Design
We consider a single-source network design problem from a game-theoretic perspective. Gupta, Kumar and Roughgarden (Proc. 35th Annual ACM STOC, pages 365–372, 2003) developed a ...
Anupam Gupta, Aravind Srinivasan, Éva Tardo...
ADHOCNOW
2011
Springer
14 years 5 months ago
Joint Duty Cycle Scheduling, Resource Allocation and Multi-constrained QoS Routing Algorithm
Wireless mesh sensor networks (WMSNs) have recently gained a lot of interest due to their communication capability to support various applications with different Quality of Service...
Jamila Ben Slimane, Yeqiong Song, Anis Koubaa, Mou...
SIGMOD
2005
ACM
74views Database» more  SIGMOD 2005»
16 years 1 months ago
Online B-tree Merging
Many scenarios involve merging of two B-tree indexes, both covering the same key range. Increasing demand for continuous availability and high performance requires that such mergi...
Xiaowei Sun, Rui Wang 0002, Betty Salzberg, Chendo...
GLVLSI
2005
IEEE
118views VLSI» more  GLVLSI 2005»
15 years 7 months ago
High-diagnosability online built-in self-test of FPGAs via iterative bootstrapping
We develop a novel on-line built-in self-test (BIST) technique for testing FPGAs that has a very high diagnosability even in presence of clustered faults, a fault pattern for whic...
Vishal Suthar, Shantanu Dutt