Sciweavers

658 search results - page 103 / 132
» Lower bounds for sorting networks
Sort
View
RTCSA
2007
IEEE
14 years 2 months ago
Virtual Full Replication by Adaptive Segmentation
We propose Virtual Full Replication by Adaptive segmentation (ViFuR-A), and evaluate its ability to maintain scalability in a replicated real-time database. With full replication ...
Gunnar Mathiason, Sten F. Andler, Sang Hyuk Son
STACS
2005
Springer
14 years 1 months ago
Improved Algorithms for Dynamic Page Migration
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
Marcin Bienkowski, Miroslaw Dynia, Miroslaw Korzen...
ICC
1997
IEEE
108views Communications» more  ICC 1997»
13 years 12 months ago
Overflow Probability in an ATM Queue with Self-Similar Input Traffic
Real measurements in high-speed communications networks have recently shown that traffic may demonstrate properties of long-range dependency peculiar to self-similar stochastic pr...
Boris Tsybakov, Nicolas D. Georganas
JACM
2008
90views more  JACM 2008»
13 years 7 months ago
Bit complexity of breaking and achieving symmetry in chains and rings
We consider a failure-free, asynchronous message passing network with n links, where the processors are arranged on a ring or a chain. The processors are identically programmed bu...
Yefim Dinitz, Shlomo Moran, Sergio Rajsbaum
MONET
2008
135views more  MONET 2008»
13 years 7 months ago
Understanding the Power of Distributed Coordination for Dynamic Spectrum Management
This paper investigates a distributed and adaptive approach to manage spectrum usage in dynamic spectrum access networks. While previous works focus on centralized provisioning, w...
Lili Cao, Haitao Zheng