251 search results - page 5 / 51 » Polynomial Time Algorithms for Three-Label Point Labeling |
ROBOTICA
2002
2002
Point-to-Point trajectory planning of flexible redundant robot manipulators using genetic algorithms
13 years 7 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...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
The purpose of this paper is to present simple and fast methods for computing control points for polynomial curves and polynomial surfaces given explicitly in terms of polynomials ...
GD
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. We deal with a map-labeling problem, named LOFL (Leftpart Ordered Flexible Labeling), to label a set of points in a plane with polygonal obstacles. The label for each poi...
IWOCA
2010
Springer
13 years 2 months ago
2010
Springer
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
COCOA
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. The search tree size of the spatial Branch-and-Bound algorithm for Mixed-Integer Nonlinear Programming depends on many factors, one of which is the width of the variable ...