2766 search results - page 176 / 554 » Algorithms for trigonometric polynomials |
162
click to vote
CSC
2009
15 years 5 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
170
click to vote
ALGORITHMICA
2002
15 years 4 months ago
2002
A proper coloring of the edges of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a (G), is the least number of...
118
click to vote
MOC
2000
15 years 4 months ago
2000
In this paper we analyze the bi-conjugate gradient algorithm in finite precision arithmetic, and suggest reasons for its often observed robustness. By using a tridiagonal structure...
145
click to vote
ROBOTICA
2002
2002
Point-to-Point trajectory planning of flexible redundant robot manipulators using genetic algorithms
15 years 4 months ago
: The paper focuses on the problem of point-to-point trajectory planning for flexible redundant robot manipulators (FRM) in joint space. Compared with irredundant flexible manipula...
168
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...