416 search results - page 41 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
101
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxiliary alg...
108
click to vote
COR
2008
15 years 2 months ago
2008
-- The optimal buffer allocation in queueing network systems is a difficult stochastic, non-linear, integer mathematical programming problem. Moreover, the objective function, the ...
143
click to vote
CDC
2010
IEEE
14 years 9 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...
120
click to vote
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
143
click to vote
SWAT
2010
Springer
15 years 20 days ago
2010
Springer
In this paper we describe an algorithm to approximately solve a class of semidefinite programs called covering semidefinite programs. This class includes many semidefinite programs...