603 search results - page 33 / 121 » A General Approximation Technique for Constrained Forest Pro... |
90
Voted
INFOCOM
2010
IEEE
14 years 12 months 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...
124
click to vote
MP
2010
14 years 12 months ago
2010
Abstract. We present a null-space primal-dual interior-point algorithm for solving nonlinear optimization problems with general inequality and equality constraints. The algorithm a...
ICSE
2009
IEEE-ACM
15 years 8 months ago
2009
IEEE-ACM
Regression test suites tend to grow over time as new test cases are added to exercise new functionality or to target newly-discovered faults. When test suites become too large, th...
135
click to vote
APPROX
2005
Springer
15 years 7 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
110
click to vote
CDC
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- In this paper, we consider the distributed computation of equilibria arising in monotone stochastic Nash games over continuous strategy sets. Such games arise in setting...