511 search results - page 6 / 103 » TSP with bounded metrics |
CIAC
2010
Springer
13 years 10 months ago
2010
Springer
In this paper, we consider variants of the traveling salesman problem with precedence constraints. We characterize hard input instances for Christofides' algorithm and Hoogeve...
TSP
2008
13 years 7 months ago
2008
We consider the problem of decentralized detection in failure-prone tree networks with bounded height. Specifically, we study and contrast the impact on the detection performance o...
TSP
2010
13 years 2 months ago
2010
Abstract--We consider the separation of Gaussian sources exhibiting general, arbitrary (not necessarily stationary) covariance structures. First, assuming a semi-blind scenario, in...
EVOW
2009
Springer
13 years 5 months ago
2009
Springer
This articles introduces a (
TSP
2008
13 years 7 months ago
2008
We derive an easy-to-compute approximate bound for the range of step-sizes for which the constant-modulus algorithm (CMA) will remain stable if initialized close to a minimum of t...