1013 search results - page 37 / 203 » A Subexponential Algorithm for Abstract Optimization Problem... |
CP
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
MOC
2010
14 years 4 months ago
2010
Abstract. Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a con...
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
Abstract-- This paper concerns the power minimization problem in server farms. The power minimization problem over dynamic power allocation schemes is formally defined and formulat...
CEC
2003
IEEE
15 years 3 months ago
2003
IEEE
Abstract- Simulated annealing (SA) is an effective general heuristic method for solving many combinatorial optimization problems. This paper deals with two problems in SA. One is ...
108
click to vote
ACCV
2007
Springer
14 years 11 months ago
2007
Springer
Abstract. The trace quotient problem arises in many applications in pattern classification and computer vision, e.g., manifold learning, low-dimension embedding, etc. The task is ...