搜索资源列表
work.zip
- 用幂法与反幂法求矩阵的最大最小特征值，以及与某个值相近的特征值，模最小的特征值，条件数与行列式,Power law with power law and anti-matrix eigenvalues of the max-min, as well as the characteristics of a value similar to the value of the smallest modulus eigenvalue condition number and determinant
ACOforTSP
- 蚁群算法的java版，需要TSP文件，输入蚂蚁量，迭代次数，权重信息等参数-Java version of the ant colony algorithm, you need to TSP file, enter the amount of ants, the number of iterations, weights and other parameters
BNC
- 朴素贝叶斯分类器（Naive Bayes Classifier），可以分类任意属性个数和目标状态的离散样例。-Naive Bayesian classifier (Naive Bayes Classifier), can be categorized arbitrary number of attributes and objectives of the state of the discrete sample.
weka-3-4-12
- weka全名是怀卡托智能分析环境（Waikato Environment for Knowledge Analysis），是一个公开的数据挖掘工作平台，集合了大量能承担数据挖掘任务的机器学习算法，包括对数据进行预处理，分类，回归、聚类、关联规则以及在新的交互式界面上的可视化-full name is weka intelligent analysis environment Waikato (Waikato Environment for Knowledge Analysis), is an o
RandomGenerator
- 建模与仿真试验中需要产生随机数，以简化模型的建立，降低仿真程序的复杂度，本程序即实现了随机数的产生。-Modeling and Simulation tests need to generate random numbers, to simplify the model, reducing the complexity of simulation program, the process of achieving a random number generation.
intersection
- 计算水平线与垂直线交点个数问题。扫描方法计算。-Calculation of horizontal and vertical line of intersection the number of questions. Scanning method.
EightNum
- 八数码问题,可以实现将九个空格里的八个数进行排列-8 digital issues, the nine spaces can be achieved in eight years with the number of
nc.jar
- Java 数值计算库 数列求和算法、求解方程的根、插值法和近似法、 数值积分、求解微分方程、矩阵运算及其它一些有趣的东西， 比如：大数、素数算法、PI、分形-Java Number Cruncher
BPIdentifyNum
- BP神经网络三层感知器数字识别系统 可以识别0-9这个十个数字-BP neural network to identify the number of three-sensor system to identify the dozens of figures 0-9
src
- 分布式系统停车场问题：某停车场共有TOTAL-NUM个车位, ENTRY-NUM个入口, EXIT-NUM个出口. 现需要一个用于停车场控制汽车进出的分布式系统, 在该系统中没有集中的管理者(central server), 每个进(出)口通过通信平等协商保存当前车库的状态信息(如空闲车位数UNOCCUPIED-NUM等), 并据此决定是否允许车辆进入, 为简便计, 假定通信是可靠的.-Parking issues distributed systems: A total of TOTAL-NU
textclusterr
- 文档分类，用K均值，加入了K的选择算法，不用人为设定聚类个数-Document classification, using K-means, joined the K of the selection algorithm, not the number of artificial clustering
ds
- 众多数据结构java applet演示程序，将抽象的数据结构算法形象化地表示出来，是学习数据结构的助手，值得大家下载学习-Large number of data structures java applet demo program, the abstract data structure visualization algorithms to be expressed, is an assistant to learn data structures, it is worth downloa
NQueen
- n皇后问题可以表示成n-元组(x1,…,xn),其中xi是放在第i行的皇后所在的列号。于是，解空间由nn个n-元组组成。 显示约束条件为Si={1,2,…….,n},1 i n。 隐式约束条件之一为没有两个xi相同(即任意两个皇后不在同一列上)。将其加入到显式条件中，于是解空间的大小由nn个元组减少到n！个元组。 -n queens problem can be expressed as n-tuple (x1, ..., xn), where xi i
jisuanjizuchnegyuanli
- 能够实现定点小数的机器数表示、定点小数的变形补码加减运算、定点小数的原码一位乘法运算和浮点数的加减运算。-Able to achieve fixed-point decimal number of machines that the deformation of complement fixed-point decimal addition and subtraction operations, the original code a fixed-point decimal multiplica
java
- 根据已知列出分级教学的人数分配和分班教学的人数与及格率的关系，然后设出16个变量，通过传统概率知识列出目标函数，通过约束条件控制变量，建立出一个非线形规划模型，利用计算机程序设计求出最优解-Listed according to the known number of grade teaching assignment and placement of teaching the relationship between numbers and pass rates, and then set o
Matrix-Chain_JAVA
- Matrix Chain Multiplication is perhaps the quintessential example of dynamic programming. The problem can be stated as follows: given a chain <A1, A2,..., An> of n matrices, where for i = 1, 2,...,n, matrix Ai has dimension pi-1 x pi, fully par
hashTable
- 数据结构课程设计——链表散列的添加修改和删除。java实现，有图形化用户界面，支持随机数生成链表。-Data Structure Course Design- list of add, modify, and delete the hash. java implementation, a graphical user interface, support for random number generation list.
JAVA-experiment-3
- １、用循环语句打印一个９９乘法表。 ２、判断回文数（逆序排列后得到的数和原数相同）。 -1, with a 99 loop Print multiplication table. 2, to determine palindrome (reverse chronological order number and the same number).
java--
- 猜数字，输入数字，程序进行比较再给出提示，再通过提示继续猜-Guess the Number, enter the number, the program prompted, and then prompted to continue guessing
tsp-java
- The task of this application was to explore the possibilities of genetic programming and to test it on a well known Traveling Salesman Problem (TSP), where the salesman should visit given number of cities and then return back home, all in the sho