Sciweavers

210 search results - page 42 / 42
» Excludability and Bounded Computational Capacity
Sort
View
SIGMETRICS
2004
ACM
124views Hardware» more  SIGMETRICS 2004»
13 years 11 months ago
Interposed proportional sharing for a storage service utility
This paper develops and evaluates new share-based scheduling algorithms for differentiated service quality in network services, such as network storage servers. This form of resou...
Wei Jin, Jeffrey S. Chase, Jasleen Kaur
SIGMETRICS
2010
ACM
173views Hardware» more  SIGMETRICS 2010»
13 years 10 months ago
Channel fragmentation in dynamic spectrum access systems: a theoretical study
Dynamic Spectrum Access systems exploit temporarily available spectrum (‘white spaces’) and can spread transmissions over a number of non-contiguous sub-channels. Such methods...
Edward G. Coffman Jr., Philippe Robert, Florian Si...
SODA
2008
ACM
108views Algorithms» more  SODA 2008»
13 years 7 months ago
Price based protocols for fair resource allocation: convergence time analysis and extension to Leontief utilities
We analyze several distributed, continuous time protocols for a fair allocation of bandwidths to flows in a network (or resources to agents). Our protocols converge to an allocati...
Ashish Goel, Hamid Nazerzadeh
CORR
2008
Springer
132views Education» more  CORR 2008»
13 years 5 months ago
Dynamic Rate Allocation in Fading Multiple-access Channels
We consider the problem of rate allocation in a fading Gaussian multiple-access channel (MAC) with fixed transmission powers. Our goal is to maximize a general concave utility func...
Ali ParandehGheibi, Atilla Eryilmaz, Asuman E. Ozd...
DKE
2008
79views more  DKE 2008»
13 years 5 months ago
Extracting k most important groups from data efficiently
We study an important data analysis operator, which extracts the k most important groups from data (i.e., the k groups with the highest aggregate values). In a data warehousing co...
Man Lung Yiu, Nikos Mamoulis, Vagelis Hristidis