Sciweavers

2084 search results - page 243 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
ALGORITHMICA
1998
143views more  ALGORITHMICA 1998»
14 years 9 months ago
On Minimum-Area Hulls
Abstract. We study some minimum-area hull problems that generalize the notion of convex hull to starshaped and monotone hulls. Specifically, we consider the minimum-area star-shap...
Esther M. Arkin, Yi-Jen Chiang, Martin Held, Josep...
ICPP
2006
IEEE
15 years 4 months ago
Worst-Case Delay Control in Multi-Group Overlay Networks
This paper proposes a novel and simple adaptive control algorithm for the effective delay control and resource utilization of EMcast when the traffic load becomes heavy in the mu...
Wanqing Tu
SPAA
2004
ACM
15 years 3 months ago
Online algorithms for prefetching and caching on parallel disks
Parallel disks provide a cost effective way of speeding up I/Os in applications that work with large amounts of data. The main challenge is to achieve as much parallelism as poss...
Rahul Shah, Peter J. Varman, Jeffrey Scott Vitter
EUC
2004
Springer
15 years 3 months ago
Power-Aware Scheduling of Mixed Task Sets in Priority-Driven Systems
We propose power-aware on-line task scheduling algorithms for mixed task sets which consist of both periodic and aperiodic tasks. The proposed algorithms utilize the execution beha...
Dongkun Shin, Jihong Kim
WAOA
2007
Springer
106views Algorithms» more  WAOA 2007»
15 years 4 months ago
Full and Local Information in Distributed Decision Making
We consider the following distributed optimization problem: three agents i = 1, 2, 3 are each presented with a load drawn independently from the same known prior distribution. Then...
Panagiota N. Panagopoulou, Paul G. Spirakis