Sciweavers

332 search results - page 14 / 67
» Traveling salesman path problems
Sort
View
APPROX
2008
Springer
135views Algorithms» more  APPROX 2008»
13 years 9 months ago
The Directed Minimum Latency Problem
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
Viswanath Nagarajan, R. Ravi
ARCS
2004
Springer
14 years 1 months ago
Ant Colony Optimization for dynamic Traveling Salesman Problems
: This paper addresses the optimization of a dynamic Traveling Salesman Problem using the Ant Colony Optimization algorithm. Ants are social insects with limited skills that live i...
Carlos A. Silva, Thomas A. Runkler
IJON
2008
177views more  IJON 2008»
13 years 7 months ago
An asynchronous recurrent linear threshold network approach to solving the traveling salesman problem
In this paper, an approach to solving the classical Traveling Salesman Problem (TSP) using a recurrent network of linear threshold (LT) neurons is proposed. It maps the classical ...
Eu Jin Teoh, Kay Chen Tan, H. J. Tang, Cheng Xiang...
CEC
2005
IEEE
14 years 1 months ago
Dynamic power minimization during combinational circuit testing as a traveling salesman problem
Testing of VLSI circuits can cause generation of excessive heat which can damage the chips under test. In the random testing environment, high-performance CMOS circuits consume sig...
Artem Sokolov, Alodeep Sanyal, L. Darrell Whitley,...
ADCM
2008
111views more  ADCM 2008»
13 years 8 months ago
Sigma-delta quantization errors and the traveling salesman problem
In transmission, storaging and coding of digital signals we frequently perform A/D conversion using quantization. In this paper we study the maxiaml and mean square errors as a res...
Yang Wang