1647 search results - page 64 / 330 » Improved Randomized Approximation Algorithms for Lot-Sizing ... |
150
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
151
Voted
HIPC
2003
Springer
15 years 9 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
122
click to vote
ALGORITHMICA
2002
15 years 4 months ago
2002
We consider the following one- and two-dimensional bucketing problems: Given a set S of n points in R1 or R2 and a positive integer b, distribute the points of S into b equal-size ...
138
click to vote
STOC
2004
ACM
16 years 4 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...
140
click to vote
ICALP
2010
Springer
15 years 9 months ago
2010
Springer
Given a positive integer n and a positive semidefinite matrix A = (Aij ) ∈ Rm×m the positive semidefinite Grothendieck problem with rank-nconstraint is (SDPn) maximize mX i=1 ...