-
电子设备密封防水用树脂介绍.rar
电子设备密封防水用树脂介绍.rar-electronic equipment sealed waterproof resin introduced. Rar
- 2022-06-20 11:44:25下载
- 积分：1
-
Elmo（埃莫）编程手册—CAN通讯手册
Elmo（埃莫）编程手册—CAN通讯手册(Elmo Motion Control CANopen DS 301 Implementation Guide)
- 2020-07-19 02:58:48下载
- 积分：1
-
《UVM实战》书籍配套源代码puvm
《UVM实战》书籍配套源代码，学习UVM的必备参考(UVM reference book, very useful)
- 2021-01-09 20:08:51下载
- 积分：1
-
PVRMS
说明： 计算平面面形的pv值和rms值，通常用在光学表面形貌测量中(Calculating the Pv value and RMS value of the plano surface)
- 2021-03-13 21:59:24下载
- 积分：1
-
数据结构教材中的全部排序算法，结构清楚 很好用的
数据结构教材中的全部排序算法，结构清楚 很好用的-data structure of all materials sorting algorithm, the structure clearly good use
- 2022-04-29 10:24:44下载
- 积分：1
-
2379210752itti_attention
经典的视觉显著性检测的论文，在网站可以找到对应的源码。很有参考价值(The classic visual detection of significant papers on the website can be found in the corresponding source code. Of great reference value)
- 2010-01-19 21:48:16下载
- 积分：1
-
Ansys-APDL
Ansys热分析过程中的热对流加载程序，经过多次验证，运行正常，无错误！(Ansys thermal analysis thermal convection loader, after repeated verification, operating normally, without errors!)
- 2015-07-03 16:38:57下载
- 积分：1
-
endnote_Chinese
说明： Endnote 是你整理文献的帮手，可以让你在众多的文献中，迅速找到你需要的信息(Endnote is to help you organize the literature, can put you at the large number of literature, quickly find the information you need)
- 2008-09-22 20:49:31下载
- 积分：1
-
这是一个Prolog实现解决一个迷宫
this a prolog implementation to solve a single maze-this is a prolog implementation to solve a single maze
- 2023-07-05 08:05:03下载
- 积分：1
-
遗传算法求解多旅行商问题
旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)
- 2020-06-17 11:00:02下载
- 积分：1
