-
matlab格拉布斯代码
说明: 应用格罗布斯原则剔除粗大误差,基于matlab(The application of grobus principle to eliminate gross errors)
- 2019-12-05 03:35:11下载
- 积分:1
-
robtic
说明: matlab机器人建模入门试验,建立多自由度机械臂,运动学仿真(Introduction test of MATLAB robot modeling, establishment of multi-degree-of-freedom manipulator, kinematics simulation)
- 2020-06-24 04:40:02下载
- 积分:1
-
06035680Dijkstra
说明: 迪杰斯特拉算法,很好用,鲁棒性强,有效。实用性强(Dijkstra algorithm, very good, robust, effective.Strong practicability)
- 2019-10-17 16:10:25下载
- 积分:1
-
灰狼算法WGO
说明: 灰狼算法与支持向量机的结合,寻求到最佳的c、g,提高系统的预测的精确度(The combination of Gray Wolf algorithm and support vector machine optimizes C, G)
- 2020-12-11 19:59:18下载
- 积分:1
-
风险投资的发展
基于VC开发的动画字体的显示,效果漂亮,-development of the VC-based animation fonts, beautiful effect,
- 2022-02-02 04:24:17下载
- 积分:1
-
Allan_Variance
allan 方差(阿伦方差)是David AIlan于1966年提出的,最初该方法是用于分析振荡器的相位和频率不稳定性,高稳定度振荡器的频率稳定度的时域表征目前均采用Allan方差。由于陀螺等惯性传感器本身也具有振荡器的特征,因此该方法随后被广泛应用于各种惯性传感器的随机误差辨识中。(Allan variance (Allen variance) was proposed by David Allan in 1966. Initially this method was used to analyze the phase and frequency instability of oscillators. The time-domain characterization of the frequency stability of high-stability oscillators is currently based on Allan variance. Since gyros and other inertial sensors also have the characteristics of oscillators, the method is subsequently widely used in the random error identification of various inertial sensors.)
- 2017-11-09 20:33:13下载
- 积分:1
-
BOXER7_15_1_15_BACKUP
说明: boxer plc program after wrapper downstream
- 2019-05-19 13:36:37下载
- 积分:1
-
局部搜索图着色
说明: 图着色局部搜索,图着色问题(Graph Coloring Problem, GCP) 又称着色问题,是最著名的NP-完全问题之一。道路着色问题(Road Coloring Problem)是图论中最著名的猜想之一。
数学定义:给定一个无向图G=(V, E),其中V为顶点集合,E为边集合,图着色问题即为将V分为K个颜色组,每个组形成一个独立集,即其中没有相邻的顶点。其优化版本是希望获得最小的K值。(Graph Coloring Problem (Graph Coloring Problem, GCP), also known as coloring problem, is one of the most famous NP-complete problems. The Road Coloring Problem is one of the most famous conjectures in graph theory.
Mathematical definition: Given an undirected graph G=(V, E), where V is the set of vertices and E is the set of edges, the graph coloring problem is to divide V into K color groups, and each group forms an independent set. That is, there are no adjacent vertices. The optimized version is to get the smallest K value.)
- 2021-04-01 16:49:10下载
- 积分:1
-
高高飞翔希望享受好的程序
loat hope enjoy good program
- 2022-01-31 17:27:25下载
- 积分:1
-
aniso
各向异性粘弹性介质地震SH波动方程正演程序(Viscoelastic SH wave equation in media)
- 2011-01-04 11:08:59下载
- 积分:1