840 search results - page 101 / 168 » Inapproximability of Combinatorial Optimization Problems |
125
Voted
WLP
2004
Springer
15 years 5 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
IJCSA
2007
15 years 10 days ago
2007
Power system defensive islanding is an efficient way to avoid catastrophic wide area blackouts, such as the 2003 North American Blackout. Finding defensive islands of large-scale ...
88
Voted
CVPR
2008
IEEE
16 years 2 months ago
2008
IEEE
Most algorithms for real-time tracking of deformable shapes provide sub-optimal solutions for a suitable energy minimization task: The search space is typically considered too lar...
103
click to vote
RECOMB
2003
Springer
16 years 22 days ago
2003
Springer
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
86
Voted
IJCNN
2006
IEEE
15 years 6 months ago
2006
IEEE
— A key step in many statistical learning methods used in machine learning involves solving a convex optimization problem containing one or more hyper-parameters that must be sel...