3874 search results - page 238 / 775 » Approximation Algorithms for k-hurdle Problems |
181
click to vote
NCA
2008
IEEE
15 years 4 months ago
2008
IEEE
The paper focuses on the study of solving the large-scale traveling salesman problem (TSP) based on neurodynamic programming. From this perspective, two methods, temporal differenc...
140
click to vote
EOR
2002
15 years 4 months ago
2002
We consider problems requiring to allocate a set of rectangular items to larger rectangular standardized units by minimizing the waste. In two-dimensional bin packing problems the...
112
click to vote
ICPR
2002
IEEE
16 years 5 months ago
2002
IEEE
We present a fast non-iterative method for approximating the leading eigenvector so as to render graph-spectral based grouping algorithms more efficient. The approximation is base...
127
click to vote
WSC
2001
15 years 5 months ago
2001
We examine the theoretical and numerical global convergence properties of a certain "gradient free" stochastic approximation algorithm called the "simultaneous pertu...
168
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
Quadratic Programming (QP) is the well-studied problem of maximizing over {−1, 1} values the quadratic form i=j aijxixj. QP captures many known combinatorial optimization proble...