搜索资源列表
A-fast-equivalent-for-System.Random
- a very well random generator code-a very well random code generator
用抛物线y=a+bx+cx 拟合给定数据
- 数值分析用抛物线y=a+bx+cx 拟合给定数据-numerical analysis using a parabolic y = bx cx fitting given data
A star算法类的C++语言实现
- A star算法类的C++语言实现-algorithm category C Language
a-1
- 求某矩阵的逆矩阵-find the inverse matrix of a matrix
A算法详细解答
- 这里有人工智能的A*算法看能不能帮到你。。我是在里面得到了不少的经验的-here is the AI A * algorithm can do to help you. . I was there to be a lot of experience
a^b-mod-c
- 给出三个整数a,b,c；求解 a^b mod c 给出三个整形，其中a>=0,b>=0,c>1.输入以 0 0 0 结束。 -Given three integers a, b, c solving a ^ b mod c Given three plastic, which a> = 0, b> = 0, c> 1. 0 0 0 to end input.
1002NA
- A polynomial of degree n has the common form as . Your task is to write a function to find a root of a given polynomial in a given interval. Format of function double Polynomial_Root(int n, double c[], double a, double b, double EPS) whe
A
- A*算法求解野人与传教士问题。A*算法求解野人与传教士问题 -A* algorithm to solve the problem of the savages and missionaries. A* algorithm for solving the savages and missionaries problem A* algorithm for solving the problem of savages and missionaries
a
- 一类块三对角矩阵的计算A class of block tridiagonal matrix calculation-A class of block tridiagonal matrix calculation
parallel-SPH-0.1.tar
- 光滑质点无网格法SPH并行计算程序，一种新型算法-Smooth particle meshless method SPH parallel computing procedures, a new type of algorithm
routePlanning
- Good route planning algorithm package. Contained A* and Djistra route finding and improved version.
Poj1022
- 本题写了一个EE3的产品描述，是四维的。确实很难想像清楚。我们这样想就行。它有四个坐标，每一维都可以放上一个立方体，边长为1.然后就是怎么判断是否Inconsistent，有两种情况：1），如题上举的例子，ID为1的在x2坐标上前面是3，那么ID为3的在X2坐标的后面应该是1，否则就Inconsistent。-We usually think that there are three geometric dimensions the fourth dimension is usually ti
eigenvalues_decomposition
- stand alone header file implementing eigen value decomposition for a symmetric matrix-stand alone header file implementing eigen value decomposition for a symmetric matrix
A
- A note on the gradient of a multi-image
AstarPath
- 经过改造与优化的A*算法， 求最短路径，能够标识出每一步寻找的结点。-After transformation and optimization of the A* algorithm, seeking the shortest path to identify each step of the search nodes.
1
- Calling a non-local algorithm for image denoising.
conjugate_grad
- 罚函数法,和matlab源代码,另加类似方法供参考,-Penalty function method, and the matlab source code, plus a similar method for reference,
binaries-2.0.5-win32
- 上传文件包括编译运行平台和许多实例。Answer set programming(简称ASP)是国外近几年兴起的一种重要的逻辑编程语言，对于求解NP问题有良好的时间上限优势。例如图的着色问题，哈密顿回路问题，sudoku问题，生物医学的特征选择问题等等。加上我上传的logic学习资料配套使用。-uploaded file include the compile and develop platform and many examples. Answer set programming is a
a
- 编写具有如下函数原型的非递归两种函数f，负责判断数组a的前n个元素是否从大到小完全有序了，是则返回true，否则返回false。并编制主函数对它们进行调用，以验证其正确性。 bool f(int a[], int n) 提示： 非递归函数中只需逐对地判断各a[i]与a[i+1]是否都已从大到小有序排列（i = 0，1，…，n-2）。-Prepared with the following function prototype of two non-recursive fun
Bayesian-maximum-a-posteriori
- 实现贝叶斯最大后验概率计算，适合原理的研究，简单易懂。-To achieve the maximum a posteriori Bayesian probability, the principle of appropriate and easily understood.