Sciweavers

30 search results - page 3 / 6
» The Greedy Algorithm for the Symmetric TSP
Sort
View
HIS
2008
13 years 6 months ago
Solving the Railway Traveling Salesman Problem via a Transformation into the Classical Traveling Salesman Problem
The Railway Traveling Salesman Problem (RTSP) is a practical extension of the classical traveling salesman problem considering a railway network and train schedules. We are given ...
Bin Hu, Günther R. Raidl
TSP
2010
12 years 12 months ago
Robust distributed source coder design by deterministic annealing
This paper considers the design of efficient quantizers for a robust distributed source coding system. The information is encoded at independent terminals and transmitted across se...
Ankur Saxena, Jayanth Nayak, Kenneth Rose
ICML
1995
IEEE
14 years 6 months ago
Ant-Q: A Reinforcement Learning Approach to the Traveling Salesman Problem
In this paper we introduce Ant-Q, a family of algorithms which present many similarities with Q-learning (Watkins, 1989), and which we apply to the solution of symmetric and asymm...
Luca Maria Gambardella, Marco Dorigo
TSP
2008
111views more  TSP 2008»
13 years 5 months ago
Space-Time Power Schedule for Distributed MIMO Links Without Instantaneous Channel State Information at the Transmitting Nodes
A space-time optimal power schedule for multiple distributed multiple-input multiple-output (MIMO) links without the knowledge of the instantaneous channel state information at th...
Yue Rong, Yingbo Hua, Ananthram Swami, A. Lee Swin...
TSP
2010
12 years 12 months ago
Coherence-based performance guarantees for estimating a sparse vector under random noise
We consider the problem of estimating a deterministic sparse vector x0 from underdetermined measurements Ax0 +w, where w represents white Gaussian noise and A is a given determinis...
Zvika Ben-Haim, Yonina C. Eldar, Michael Elad