4894 search results - page 509 / 979 » The Guarding Problem - Complexity and Approximation |
139
click to vote
IANDC
2006
15 years 4 months ago
2006
Dynamic Programming solves combinatorial optimization problems by recursive decomposition and tabulation of intermediate results. The first step in the design of a dynamic program...
133
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
In this article, we study the problem of finding the longest common separable pattern between several permutations. We give a polynomial-time algorithm when the number of input pe...
138
click to vote
MOR
2008
15 years 4 months ago
2008
We prove that if two smooth manifolds intersect transversally, then the method of alternating projections converges locally at a linear rate. We bound the speed of convergence in ...
133
click to vote
TWC
2008
15 years 4 months ago
2008
It is a challenging task for multi-hop wireless networks to support multimedia applications with quality-ofservice (QoS) requirements. This letter presents a joint crosslayer optim...
132
click to vote
IJRR
2002
15 years 4 months ago
2002
We address the motion planning problem (open-loop trajectory design) for manipulating rigid bodies with permanent rolling contact without slipping. This problem is related in part...