840 search results - page 69 / 168 » Inapproximability of Combinatorial Optimization Problems |
137
Voted
AAAI
1994
15 years 1 months ago
1994
We present a theory of a modeler's problem decomposition skills in the context of optimal reasonzng -- the use of qualitative modeling to strategically guide numerical explor...
78
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper a method for the fast determination of distortion-based optimal unequal error protection (UEP) of bitstreams generated by embedded image coders is described. The ...
113
click to vote
STOC
2004
ACM
16 years 21 days ago
2004
ACM
Several combinatorial optimization problems choose elements to minimize the total cost of constructing a feasible solution that satisfies requirements of clients. In the STEINER T...
105
click to vote
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
We propose a solution to the n-frame correspondence problem under the factorization framework. During the matching process, our algorithm takes explicitly into account the geometr...
94
Voted
ISNN
2009
Springer
15 years 7 months ago
2009
Springer
Quantum evolutionary algorithm (QEA) is proposed on the basis of the concept and principles of quantum computing, which is a classical metaheuristic algorithm for the approximate s...