7930 search results - page 659 / 1586 » Greedy in Approximation Algorithms |
214
Voted
STOC
2001
ACM
16 years 7 months ago
2001
ACM
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
203
click to vote
APPROX
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. This work considers the problem of approximating fixed predicate constraint satisfaction problems (MAX k-CSP(P)). We show that if the set of assignments accepted by P co...
185
click to vote
MP
1998
15 years 7 months ago
1998
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...
220
click to vote
CDC
2010
IEEE
15 years 2 months ago
2010
IEEE
This research concerns a noncooperative dynamic game with large number of oscillators. The states are interpreted as the phase angles for a collection of non-homogeneous oscillator...
221
Voted
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—Dual descent methods are commonly used to solve network optimization problems because their implementation can be distributed through the network. However, their convergence rat...