1566 search results - page 79 / 314 » On a Cone Covering Problem |
155
click to vote
SIAMCO
2010
15 years 28 days ago
2010
A minimum time problem with a nonlinear smooth dynamics and a target satisfying an internal sphere condition is considered. Under the assumption that the minimum time T be continu...
129
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper we consider the problem of detecting multiple point-like targets in the presence of steering vector mismatches and Gaussian disturbance with unknown covariance matri...
181
click to vote
AMAI
2000
Springer
15 years 9 months ago
2000
Springer
This paper proposes new algorithms for the Binate Covering Problem (BCP), a well-known restriction of Boolean Optimization. Binate Covering finds application in many areas of Comp...
210
click to vote
ESA
2003
Springer
15 years 11 months ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
157
click to vote
CCCG
2007
15 years 7 months ago
2007
In this paper, we introduce a generalized version of the Watchman Route Problem (WRP) where the objective is to plan a continuous closed route in a polygon (possibly with holes) a...