travelling - 电子资料标签 - 虫虫电子下载站

dw1000双向测距的实现(英文版)

<p>INTRODUCTION In this application note two-way ranging (TWR) scheme as used by Decawave’s example application (DecaRanging) is described. TWR is a basic concept to calculate the distance between tw

📅 2022-08-22 10:00:02 ⬇️ 8 👁️ 9,682

solving travelling sellsman problem

📅 2017-09-25 00:03:01 ⬇️ 27 👁️ 1,120

旅行商问题（Travelling Salesman Problem, 简记TSP

旅行商问题（Travelling Salesman Problem, 简记TSP，亦称货郎担问题)：设有n个城市和距离矩阵D=[dij]，其中dij表示城市i到城市j的距离，i，j=1，2 … n，则问题是要找出遍访每个城市恰好一次的一条回路并使其路径长度为最短。

📅 2017-09-14 20:20:02 ⬇️ 187 👁️ 1,123

Flight panel java GUI selecting the departure city, origin city, the day and time of travel, number

Flight panel java GUI selecting the departure city, origin city, the day and time of travel, number of adults and children travelling and will calculate the total order.

📅 2017-08-11 00:15:02 ⬇️ 54 👁️ 1,133

Travelling saleman by C++

📅 2017-05-04 00:01:03 ⬇️ 59 👁️ 1,045

The source code of Travelling Salesman Problem. Implement in Visual C++.

📅 2016-08-13 00:04:02 ⬇️ 190 👁️ 1,161

TSP问题的动态规划求解。问题描述：旅行商问题

TSP问题的动态规划求解。问题描述：旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。

📅 2016-05-21 10:21:02 ⬇️ 146 👁️ 1,060

这是一个用遗传算法来求解旅行商问题（TSP问题：Travelling Salesman Problem）的源代码

这是一个用遗传算法来求解旅行商问题（TSP问题：Travelling Salesman Problem）的源代码，学习遗传算法，演化计算的很值得一看！

📅 2016-02-05 20:08:01 ⬇️ 167 👁️ 1,089

A new cable fault location method based on wavelet reconstruction is proposed. In this method the

A new cable fault location method based on wavelet reconstruction is proposed. In this method the difference between the currents of faulty phase and sound phase under the high voltage pulse excita

📅 2016-02-04 00:33:02 ⬇️ 82 👁️ 1,121