3874 search results - page 344 / 775 » Approximation Algorithms for k-hurdle Problems |
196
click to vote
FLAIRS
2004
15 years 8 months ago
2004
In this paper the distributed Constraint Satisfaction Ant Algorithm (CSAA) framework is presented. It uses an ant-based system for the distributed solving of constraint satisfacti...
221
click to vote
SIAMJO
2010
15 years 5 months ago
2010
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
172
click to vote
WSC
2008
15 years 9 months ago
2008
We consider discrete stochastic optimization problems where the objective function can only be estimated by a simulation oracle; the oracle is defined only at the discrete points....
159
click to vote
FSTTCS
2009
Springer
16 years 1 months ago
2009
Springer
We describe a simple iterative method for proving a variety of results in combinatorial optimization. It is inspired by Jain’s iterative rounding method (FOCS 1998) for designing...
226
click to vote
STOC
1999
ACM
15 years 11 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...