搜索资源列表
H
- 主要是计算最佳哈密尔顿圈，利用二边逐次修正法实现，需要先给出带权的邻接矩阵。 注：利用矩阵翻转法求最佳H圈.pdf是h.m文件的说明文件。-Main is calculated by use of the second best Hamilton circle, edge successive correction method of realization, need to first presents the adjacency matrix with weight. Note: u
On-State-Feedback-Control
- 状态反馈控制混沌系统 利用一种简单的线性状态反馈方法控制混沌运动 ,引导混沌系统稳定到失稳的平衡点或 周期轨道上 ,用劳斯2胡尔维茨稳定判据判定受控系统在平衡点处参数的取值范围 ,同时使用广义 Hamilton 系统理论的 Melnikov 方法分析受控系统的周期解. 通过对典型的混沌系统进行数值仿 真 ,证实了该控制方法的有效性.- A Linear state feedback control technique is used to guide the typical ch
method
- 哈密尔顿系统的有限元法Hamilton system, finite element method-Hamilton system, finite element method
ACO_Hamilton
- 哈米尔顿回路！！！经典的ACO_Hamilton！！！图论必用-Hamilton circuit! ! ! Classic ACO_Hamilton! ! ! Graph theory must be used
H_J_two_dim
- 偏微分方程中利用数值方法求解Hamilton-Jacobi方程 二维情形 -Numerical calculation of Hamilton-Jacobi equation
1
- 广义五阶KdV方程的Hamilton对称性与局部守恒律.-Generalized fifth-order KdV equation of Hamilton and the local symmetry conservation law.
4343
- 广义五阶KdV方程的Hamilton对称性与局部守恒律.-failed to translate
Hamilton
- 也是最优路径问题，编译后会得到一个最短的路径-Is the optimal path problem, the compiler will get a shortest path
rounds-of-disaster
- 关于灾情巡视路线问题的数学模型，利用的是Floyd算法以及Hamilton圈改良算法-a modeling about rounds of disaster，taking advantage of the Floyd algorithm and improved Hamilton circle algorithm
HJB_Solver_Package
- Hamilton-Jacobi solver on unstructured triangular grids
Computer-Aided-Detection-of-Centroblasts-for
- centroblast on cell segmentation that can be found using hamilton
Graph-theory-and-applications
- 图论及应用 了解图的基本概念如树、图的连通性、Euler图、Hamilton图，以及图的匹配与因子分解，还有平面图和图的着色，有向图，图、群与矩阵-Graph theory and applications、 Euler Graph、 Hamilton Graph、Connectivity of Graph
hamilton
- new approach for finding the hamiltanion cycle in polynomial time . bit it is not proved-new approach for finding the hamiltanion cycle in polynomial time . bit it is not proved.....
hamilton_data
- data GDP paper hamilton.rar
graph
- matlab、C代码，实现图论中的大部分算法，包括kruskal、Dijkstra、prim、hamilton等 -Matlab,C code for most algorithms of graph theory.
Graph-theory-algorithm-set
- 对matlab解决图论问题的算法做个汇总。主要包括：顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。-Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and m
12345
- 提供一种求解最优哈密尔顿的算法---三边交换调整法，要求在运行jiaohuan3（三交换法）之前，给定邻接矩阵C和节点个数N，结果路径存放于R中。-Hamilton provides an optimal algorithm for solving triangular exchange--- Adjustment Act to require running jiaohuan3 (c exchange) before the adjacency matrix C, given the num
789
- Data for Hamilton MS AR
Caley_Hamilton
- Solves linear equations in 3 variables using Caley-Hamilton theorem
knight2
- 8*8的国际象棋棋盘上的一只马，恰好走过除起点外的其它63个位置各一次，最后回到起点，这条线路成为马的一条Hamilton周游路线-8* 8 chess board on a horse, just walked the other outside the starting point of the 63 position each time, and finally back to the starting point, the lines become a horse of a Hamilt