Sciweavers

676 search results - page 116 / 136
» On Approximation Lower Bounds for TSP with Bounded Metrics
Sort
View
NCA
2009
IEEE
14 years 2 months ago
Analysis of Round-Robin Implementations of Processor Sharing, Including Overhead
—It has been observed in recent years that in many applications service time demands are highly variable. Without foreknowledge of exact service times of individual jobs, process...
Steve Thompson, Lester Lipsky, Sarah Tasneem, Feng...
RANDOM
1998
Springer
13 years 11 months ago
On-Line Bin-Stretching
We are given a sequence of items that can be packed into m unit size bins. In the classical bin packing problem we x the size of the bins and try to pack the items in the minimum ...
Yossi Azar, Oded Regev
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
13 years 9 months ago
Online make-to-order joint replenishment model: primal dual competitive algorithms
In this paper, we study an online make-to-order variant of the classical joint replenishment problem (JRP) that has been studied extensively over the years and plays a fundamental...
Niv Buchbinder, Tracy Kimbrel, Retsef Levi, Konsta...
MOBIHOC
2006
ACM
14 years 7 months ago
Starvation mitigation through multi-channel coordination in CSMA multi-hop wireless networks
Existing multi-channel protocols have been demonstrated to significantly increase aggregate throughput compared to single-channel protocols. However, we show that despite such imp...
Jingpu Shi, Theodoros Salonidis, Edward W. Knightl...
ALT
2008
Springer
14 years 4 months ago
Optimally Learning Social Networks with Activations and Suppressions
In this paper we consider the problem of learning hidden independent cascade social networks using exact value injection queries. These queries involve activating and suppressing a...
Dana Angluin, James Aspnes, Lev Reyzin