Sciweavers

1257 search results - page 241 / 252
» Near-Optimal Scheduling of Distributed Algorithms
Sort
View
SPAA
2005
ACM
15 years 3 months ago
Dynamic page migration with stochastic requests
The page migration problem is one of subproblems of data management in networks. It occurs in a distributed network of processors sharing one indivisible memory page of size D. Du...
Marcin Bienkowski
SIGECOM
2003
ACM
174views ECommerce» more  SIGECOM 2003»
15 years 3 months ago
Collaboration software to reduce inventory and increase response
Some recent trends in business and manufacturing hold the promise of greater profits, yet, due to profit-robbing inventory increases, this promise has not been fully realized. [9]...
Indu Bingham, Barbara Hoefle, Kim Phan, Jim Sizemo...
JAVA
2001
Springer
15 years 2 months ago
A scalable, robust network for parallel computing
CX, a network-based computational exchange, is presented. The system’s design integrates variations of ideas from other researchers, such as work stealing, non-blocking tasks, e...
Peter R. Cappello, Dimitros Mourloukos
ANSS
1996
IEEE
15 years 2 months ago
Computation of the Asymptotic Bias and Variance for Simulation of Markov Reward Models
The asymptotic bias and variance are important determinants of the quality of a simulation run. In particular, the asymptotic bias can be used to approximate the bias introduced b...
Aad P. A. van Moorsel, Latha A. Kant, William H. S...
DCOSS
2006
Springer
15 years 1 months ago
Lifetime Maximization of Sensor Networks Under Connectivity and k-Coverage Constraints
In this paper, we study the fundamental limits of a wireless sensor network's lifetime under connectivity and k-coverage constraints. We consider a wireless sensor network wit...
Wei Mo, Daji Qiao, Zhengdao Wang