搜索资源列表
SGA_java
- 用JAVA写的遗传算法的例子，比较简单，如果解压缩的时候需要密码的话，应该是“1”。写的比较简单。是老早以前写的了。-using Java to write the genetic algorithm example, relatively simple, if decompression time requires a password, then it should be "one." The relatively simple to write. Before long
GameOfLife_java
- 生命游戏的java源代码。基于元胞自动机的生命游戏，是学习和深入CA方法的很好例子。-life game of java source code. Based on Cellular Automata game of life, and in-depth study of CA good example.
java版Ｂ+树程序
- java 版B+树程序-java version of B+ tree procedure
PrefixSpan
- java版的PrefixSpan算法实现，文件里包含了详细的文档说明，还有示例。-PrefixSpan algorithm. The document containing a detailed descr iption and an example.
java
- 使用java压缩文件的例子 -The example of using java to compress file
example
- 常见java数据结构的使用方法，包括Arrays类Collections类HashSet类List类TreeSet类Map类Vector类-Java data structures commonly used methods, including Arrays Class Collections category HashSet Class List Class TreeSet Class Map type Vector Class
diaodu
- 两台处理机A 和B处理n个作业。设第i个作业交给机器 A 处理时需要时间ai，若由机器B 来处理，则需要时间bi。由于各作 业的特点和机器的性能关系，很可能对于某些i，有ai >=bi，而对于 某些j，j!=i，有aj<bj。既不能将一个作业分开由两台机器处理，也没 有一台机器能同时处理2 个作业。设计一个动态规划算法，使得这两 台机器处理完成这n 个作业的时间最短（从任何一台机器开工到最后 一台机器停工的总时间）。研究一个实例：（a1,a2,a3,a4,a5
dijkstra-java
- Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。 -Dijkstra algorithm is a typical example of the most short-circuit algorithm, used
gangqin
- 本程序制作模拟钢琴的实例。程序执行后，创建一个带有模拟钢琴键盘的面板，用户可以通过键盘或者鼠标来“敲击”钢琴键盘发出声音，也可以通过电脑键盘的组合键实现钢琴的高音。-This procedure produced an example of simulation of the piano. Procedures implemented, to create a simulation of the piano keyboard with a panel, the user can, through
Temperature
- Fuzzy logic example that sorts temperatures into fuzzy sets.
HashTableApp
- 简单的HASH，显示简单的哈希算法，算是一个例子新手见谅-Simple HASH, shows a simple hash algorithm will be forgiven as an example of new
Strassen
- Example of the Strassen Algoritms.
Huffman_coding_(Java)
- Given an arbitrary set of symbols (the english alphabet is the example that will be used here), Huffman coding is a way of creating the most efficient (smallest) binary code for that set of symbols. It exploits the fact that in most data some symbols
wanggediaodu
- 用蚂蚁算法和遗传算法结合实现的网格调度问题-Classic example of a genetic algorithm, a visual interface to their own clicks, the problem described in TSP
FastICA_2_5
- 独立成分分析(Independent Compondent Analysis，ICA)的一个非常好的示例，可以直接拿来用-Independent Component Analysis (Independent Compondent Analysis, ICA) in a very good example, can be directly used
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
JSlider-Example
- javaslidercode for java beginner
ml
- BP神经网络的Java示例，通过样本训练，能够准确地判断出它是奇数还是偶数，正数还是负数。-Java example BP neural network trained by the sample, can accurately determine that it is odd or even, positive or negative.
encog-sample-java
- encog for java的一个Java代码实例(encog sample java An example of the open source depth learning framework, encog)
PSO
- PSO的java基本实现，以及一种的改进版本，并且以Rastrigin函数为例，探究其运行效果(PSO java basic implementation, as well as an improved version, and take Rastrigin function as an example to explore its operation effect)