3874 search results - page 134 / 775 » Approximation Algorithms for k-hurdle Problems |
103
Voted
SIAMCO
2000
15 years 1 months ago
2000
It is shown here that stability of the stochastic approximation algorithm is implied by the asymptotic stability of the origin for an associated ODE. This in turn implies convergen...
INFOCOM
2010
IEEE
15 years 6 days ago
2010
IEEE
—Many important network design problems can be formulated as a combinatorial optimization problem. A large number of such problems, however, cannot readily be tackled by distribu...
115
click to vote
JACM
1998
15 years 1 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
115
click to vote
ISAAC
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. In this paper, we consider the problem of computing a minimum bending energy path (or MinBEP) in a simple corridor. Given a simple 2D corridor C bounded by straight line ...
133
click to vote
WDAG
2010
Springer
15 years 3 days ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...