416 search results - page 10 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
ICTAI
2009
IEEE
13 years 6 months ago
2009
IEEE
We propose a framework which we call stochastic offline programming (SOP). The idea is to embed the development of combinatorial algorithms in an off-line learning environment whi...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
Finding the largest independent set in a graph is a notoriously difficult NP-complete combinatorial optimization problem. Moreover, even for graphs with largest degree 3, no polyn...
SIGECOM
2000
ACM
14 years 29 days ago
2000
ACM
General combinatorial auctions—auctions in which bidders place unrestricted bids for bundles of goods—are the subject of increasing study. Much of this work has focused on alg...
ORL
1998
13 years 8 months ago
1998
We present algorithms to calculate the stability radius of optimal or approximate solutions of binary programming problems with a min sum or min max objective function. Our algori...
GECCO
2010
Springer
13 years 10 months ago
2010
Springer
Several population-based methods (with origins in the world of evolutionary strategies and estimation-of-distribution algorithms) for black-box optimization in continuous domains ...