252 search results - page 14 / 51 » tsp 2008 |
CEC
2008
IEEE
15 years 4 months ago
2008
IEEE
— The problem of robotic area coverage is applicable to many domains, such as search, agriculture, cleaning, and machine tooling. The robotic area coverage task is concerned with...
SODA
2008
ACM
14 years 11 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
COR
2008
14 years 9 months ago
2008
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
TSP
2008
14 years 9 months ago
2008
In this paper, we consider a coded transmission over a frequency selective channel. We propose to study analytically the convergence of the turbo-detector using a maximum a poster...
TSP
2008
14 years 9 months ago
2008
This article introduces the concept of sensing dictionaries. It presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their...