Sciweavers

2252 search results - page 281 / 451
» Lower Bounds for Dynamic Algorithms
Sort
View
136
Voted
ANCS
2005
ACM
15 years 9 months ago
Group round robin: improving the fairness and complexity of packet scheduling
We present Group Round-Robin (GRR) scheduling, a hybrid fair packet scheduling framework based on a grouping strategy that narrows down the traditional trade-off between fairness ...
Bogdan Caprita, Jason Nieh, Wong Chun Chan
182
Voted
HPDC
2011
IEEE
14 years 7 months ago
Juggle: proactive load balancing on multicore computers
We investigate proactive dynamic load balancing on multicore systems, in which threads are continually migrated to reduce the impact of processor/thread mismatches to enhance the ...
Steven Hofmeyr, Juan A. Colmenares, Costin Iancu, ...
167
Voted
NETWORKING
2011
14 years 6 months ago
The Problem of Sensing Unused Cellular Spectrum
Abstract. Sensing mechanisms that estimate the occupancy of wireless spectrum are crucial to the success of approaches based on Dynamic Spectrum Access. In this paper, we present k...
Daniel Willkomm, Sridhar Machiraju, Jean Bolot, Ad...
136
Voted
CIDU
2010
15 years 1 months ago
Optimal Partitions of Data In Higher Dimensions
Given any collection of data cells in a data space X, consider the problem of finding the optimal partition of the data cells into blocks which are unions of cells. The algorithms...
Bradley W. Jackson, Jeffrey D. Scargle, Chris Cusa...
119
Voted
CORR
2007
Springer
134views Education» more  CORR 2007»
15 years 3 months ago
Rate-Constrained Wireless Networks with Fading Channels: Interference-Limited and Noise-Limited Regimes
A network of n wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power P or rema...
Masoud Ebrahimi, Amir K. Khandani