43 search results - page 3 / 9 » Fast Probabilistic Modeling for Combinatorial Optimization |
STOC
2004
ACM
15 years 9 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...
106
click to vote
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
ISQED
2007
IEEE
15 years 3 months ago
2007
IEEE
— Fast and accurate routing congestion estimation is essential for optimizations such as floorplanning, placement, buffering, and physical synthesis that need to avoid routing c...
101
click to vote
SAGA
2009
Springer
15 years 4 months ago
2009
Springer
Stochastic programming problems appear as mathematical models for optimization problems under stochastic uncertainty. Most computational approaches for solving such models are base...
IPMI
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. The detection and extraction of complex anatomical structures usually involves a trade-off between the complexity of local feature extraction and classification, and th...