3875 search results - page 129 / 775 » Approximation algorithms for the 0-extension problem |
143
Voted
SIAMSC
2010
14 years 11 months ago
2010
In this paper we proposed quasi-Newton and limited memory quasi-Newton methods for objective functions defined on Grassmannians or a product of Grassmannians. Specifically we defin...
139
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
We formulate the problem of computing equilibria in multiplayer games represented by arbitrary undirected graphs as a constraint satisfaction problem and present two algorithms. T...
159
Voted
FSTTCS
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. Shop scheduling problems are known to be notoriously intractable, both in theory and practice. In this paper we give a randomized approximation algorithm for flow shop s...
125
Voted
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a new problem in the study of doubling spaces: Given a point set S and a target dimension d , remove from S the fewest number of points so that the remaining set has d...
157
Voted
CDC
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper considers consensus problems with delayed noisy measurements, and stochastic approximation is used to achieve mean square consensus. For stochastic approximation based c...