3 search results - page 1 / 1 » Smoothed analysis of algorithms: why the simplex algorithm u... |
STOC
2001
ACM
14 years 5 months ago
2001
ACM
STOC
2004
ACM
14 years 5 months ago
2004
ACM
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
NIPS
2007
13 years 6 months ago
2007
This contribution develops a theoretical framework that takes into account the effect of approximate optimization on learning algorithms. The analysis shows distinct tradeoffs for...