1647 search results - page 210 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
135
click to vote
EOR
2010
15 years 2 months ago
2010
Abstract: Probabilistically constrained problems, in which the random variables are finitely distributed, are nonconvex in general and hard to solve. The p-efficiency concept has b...
145
click to vote
PODS
2005
ACM
16 years 2 months ago
2005
ACM
Suppose we have a large table T of items i, each with a weight wi, e.g., people and their salary. In a general preprocessing step for estimating arbitrary subset sums, we assign e...
147
Voted
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
We propose a new active learning algorithm to address the problem of selecting a limited subset of utterances for transcribing from a large amount of unlabeled utterances so that ...
ICDCS
1999
IEEE
15 years 6 months ago
1999
IEEE
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each req...
157
click to vote
SWAT
2010
Springer
15 years 7 months ago
2010
Springer
We consider the problem of partitioning the set of vertices of a given unit disk graph (UDG) into a minimum number of cliques. The problem is NP-hard and various constant factor a...