12519 search results - page 310 / 2504 » Approximation Problems Categories |
147
click to vote
PUK
2003
15 years 8 months ago
2003
Planning is known to be a difficult task. One of the approaches used to reduce this difficulty is problem decomposition under divide-and-conquer methodology. This paper introduce...
182
click to vote
AAECC
2006
Springer
15 years 6 months ago
2006
Springer
So-called nonadjacent representations are commonly used in elliptic curve cryptography to facilitate computing a scalar multiple of a point on an elliptic curve. A nonadjacent rep...
184
click to vote
JSAT
2006
15 years 6 months ago
2006
Semidefinite optimization, commonly referred to as semidefinite programming, has been a remarkably active area of research in optimization during the last decade. For combinatoria...
215
click to vote
NCA
2008
IEEE
15 years 6 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...
175
click to vote
EOR
2002
15 years 6 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...