-
ex_ori
解算双像片空间后方交会中像片的6个外方位元素，精度达到0.001(Solution double photo photo space resection in 6 of exterior orientation elements, the precision of 0.001)
- 2011-01-10 21:49:03下载
- 积分：1
-
一个非常好的微处理器检测遥控器编码的C++
原代码项目文件,直接可用,LED显示...
一个非常好的微处理器检测遥控器编码的C++
原代码项目文件,直接可用,LED显示-a very good microprocessor remote detection coding in C source code, project documentation, direct can be used, LED Display
- 2022-03-05 14:00:53下载
- 积分：1
-
NDVI
多种方法实现栅格数据计算NDVI，包括逐个像素处理、栅格计算器计算。(A variety of methods to calculate raster NDVI, including by-pixel processing, raster calculator.)
- 2020-12-29 10:29:01下载
- 积分：1
-
新浪微博视频上传
简单的上传视频源码,其它都没写,用的精易模块,(Simple upload video source code, with the fine easy module,)
- 2017-09-23 09:26:01下载
- 积分：1
-
50309286
Socket programming book server chat
- 2021-01-05 10:38:54下载
- 积分：1
-
C#实现多表连接的条件语句查询实例
C#实现多表连接的条件语句查询实例，一个基于数据库的复合查询示例，多表连接条件查询，将两个或多个表的数据整合在一起进行多条件的查询。
- 2022-04-19 17:12:49下载
- 积分：1
-
Desktop
热扩散LBM程序,格子玻尔兹曼方法，小红书一维热扩散(program for heat diffusion D1Q3)
- 2021-03-23 15:29:15下载
- 积分：1
-
samsung公司的s3c2443的的原理图，包括核心板和底板，希望对大家有用...
samsung公司的s3c2443的的原理图，包括核心板和底板，希望对大家有用-samsung" s schematic diagram of the s3c2443, including the core board and floor, in the hope that useful
- 2022-01-26 05:51:29下载
- 积分：1
-
xinhaoht2
说明： 蚁群算法的基本程序，适合入门学习用，注释比较完整(it about ant algrthom)
- 2019-06-22 00:45:14下载
- 积分：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
