4843 search results - page 202 / 969 » The Shortcut Problem - Complexity and Approximation |
139
Voted
AAECC
2006
Springer
15 years 3 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...
137
click to vote
JSAT
2006
15 years 3 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...
175
click to vote
NCA
2008
IEEE
15 years 3 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...
131
Voted
EOR
2002
15 years 3 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...
124
Voted
MOC
1998
15 years 3 months ago
1998
Abstract. We consider numerical methods for a “quasi-boundary value” regularization of the backward parabolic problem given by ut + Au = 0 , 0 < t < T u(T ) = f, where A ...