1647 search results - page 79 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
122
click to vote
ICDCS
2010
IEEE
15 years 8 months ago
2010
IEEE
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
128
click to vote
APPROX
2008
Springer
15 years 6 months ago
2008
Springer
Clustering is a common problem in the analysis of large data sets. Streaming algorithms, which make a single pass over the data set using small working memory and produce a cluster...
144
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
We consider the problem of representing, in a space-efficient way, a function f : S → Σ such that any function value can be computed in constant time on a RAM. Specifically, ou...
126
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we will describe some heuristics that can be used to improve the runtime of a wide range of commonly used algorithms for the negative cycle detection problem signi...
127
click to vote
CSE
2008
IEEE
15 years 4 months ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n