Consider a distributed network with nodes arranged in a tree, and each node having a local value. We consider the problem of aggregating values (e.g., summing values) from all nod...
C. Greg Plaxton, Mitul Tiwari, Praveen Yalagandula
Effective scheduling in large-scale computational grids is challenging because it requires tracking the dynamic state of the large number of distributed resources that comprise th...
Deger Cenk Erdil, Michael J. Lewis, Nael B. Abu-Gh...
Nowadays, the rapid advances in wireless communications, positioning techniques and mobile devices enable location based service such as dynamic traffic navigation. Yet, it is a ch...
Yun Bai, Yanyan Guo, Xiaofeng Meng, Tao Wan, Karin...
Outer linearization methods for two-stage stochastic linear programs with recourse, such as the L-shaped algorithm, generally apply a single optimality cut on the nonlinear object...
Svyatoslav Trukhanov, Lewis Ntaimo, Andrew Schaefe...
Many “ubiquitous computing” applications need a constant flow of information about their environment to be able to adapt to their changing context. To support these “contex...