Sciweavers

1110 search results - page 141 / 222
» New Approximation Results for Resource Replication Problems
Sort
View
SODA
2008
ACM
77views Algorithms» more  SODA 2008»
15 years 13 days 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...
STOC
2009
ACM
96views Algorithms» more  STOC 2009»
15 years 11 months ago
MaxMin allocation via degree lower-bounded arborescences
We consider the problem of MaxMin allocation of indivisible goods. There are m items to be distributed among n players. Each player i has a nonnegative valuation pij for an item j...
MohammadHossein Bateni, Moses Charikar, Venkatesan...
APCSAC
2006
IEEE
15 years 5 months ago
A High Performance Simulator System for a Multiprocessor System Based on a Multi-way Cluster
In the ubiquitous era, it is necessary to research the architectures of multiprocessor system with high performance and low power consumption. A simulator developed in high level l...
Arata Shinozaki, Masatoshi Shima, Minyi Guo, Mitsu...
HT
2010
ACM
15 years 4 months ago
Of categorizers and describers: an evaluation of quantitative measures for tagging motivation
While recent research has advanced our understanding about the structure and dynamics of social tagging systems, we know little about (i) the underlying motivations for tagging (w...
Christian Körner, Roman Kern, Hans-Peter Grah...
81
Voted
ICML
2008
IEEE
15 years 12 months ago
Empirical Bernstein stopping
Sampling is a popular way of scaling up machine learning algorithms to large datasets. The question often is how many samples are needed. Adaptive stopping algorithms monitor the ...
Csaba Szepesvári, Jean-Yves Audibert, Volod...