搜索资源列表
JAVA的计算器
- 这个无限位计算器，N!及N的平方了。本来是打算用堆栈去实现的，突然发现了BigDecimal这个好东东～～于是乎～～堆栈在偶的计算器里退休了。。。 这个是在JDK 5.0 Update 3下用 NetBeans 4.1写的，我试过了两个1.4.2版本的，总说找不到MAIN()方法，对NetBeans打的包。。偶有置疑。。。所以拆开来。。。*.calss + 一个批处理＋*.java打成了个压缩包传了上来～～ -the infinite spaces calculators, N!
java实现质数
- java实现质数，短小精干，有解释-few, small and lean, it was explained
Matrix.设计一个造成矩阵类Matrix
- 设计一个造成矩阵类Matrix，包含一个元素类型为int的二维数组，分别设计一个静态方法和实例方法把矩阵转置，分别设计静态方法和实例方法实现二个矩阵相加、相乘。重写方法toString()，使其能输出此矩阵。,Caused by the design of a matrix of type Matrix, contains an element type for the two-dimensional array of int, respectively, to design a static
vista
- 贝叶斯算法源代码以及它应用于垃圾短信过滤的源代码。是用java写的算法。-Bayesian algorithm source code and how it applies to the source code for filtering spam messages. Algorithm is written in java.
diaodu
- 两台处理机A 和B处理n个作业。设第i个作业交给机器 A 处理时需要时间ai，若由机器B 来处理，则需要时间bi。由于各作 业的特点和机器的性能关系，很可能对于某些i，有ai >=bi，而对于 某些j，j!=i，有aj<bj。既不能将一个作业分开由两台机器处理，也没 有一台机器能同时处理2 个作业。设计一个动态规划算法，使得这两 台机器处理完成这n 个作业的时间最短（从任何一台机器开工到最后 一台机器停工的总时间）。研究一个实例：（a1,a2,a3,a4,a5
bp
- 绝对自己写的JAVA程序，对BP神经网络的实现，用面向对象的思想完成。可以作为初学者使用-Absolutely wrote it myself JAVA procedures, achievement of BP neural network, with complete object-oriented thinking. Can serve as a beginner to use
dijkstra-java
- Dijkstra算法是典型的最短路算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。 Dijkstra算法能得出最短路径的最优解，但由于它遍历计算的节点很多，所以效率低。Dijkstra算法是一种逐步搜索算法，通过为每个顶点n保留目前为止所找到的从m到n的最短路径来工作的。 -Dijkstra algorithm is a typical example of the most short-circuit algorithm, used
Mapack_for_NET
- Mapack可用来做矩阵运算 Mapack is a .NET class library for basic linear algebra computations. It supports the following matrix operations and properties: Multiplication, Addition, Subtraction, Determinant, Norm1, Norm2, Frobenius Norm, Infinity Norm, Rank,
jgap_3.4.3_src
- JGAP是一种遗传算法和遗传规划的组成部分提供了一个Java框架。它提供了基本的遗传机制，可以很容易地用来申请进化原则问题的解决办法。见实例演示或观赏树的图形，可以创建JGAP找到解决办法的基因进化程序。-JGAP is a genetic algorithm and genetic programming an integral part of providing a Java framework. It provides basic genetic mechanisms, can easil
Planer_convex_hull
- A Convex Hull is the smallest convex polygon that contains every point of the set S. A polygon P is convex if and only if, for any two points A and B inside the polygon, the line segment AB is inside P. One way to visualize a convex hull is to put
texture
- this is texture analyzer code to segment an image replying on the texture feature,it is programmed in java
java
- 图片，很经常用的一副matlab里面的图片-Picture, it is often used inside a pair of matlab Photos
KnapsackProblem
- 0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
gui_antminer1.2.1
- Short descr iption: GUI Ant-Miner is a tool for extracting classification rules from data. It is an updated version of a data mining algorithm called Ant-Miner (Ant Colony-based Data Miner), which was proposed in 2002 by Parpinelli, Lopes and Freitas
mail
- java Email you can use it to send email to others
GA(java)
- 遺傳演算法(Genetic Algorithm),使用java編譯，有需要者拿回去參考吧！-Genetic algorithm (Genetic Algorithm), using the java compiler, there is a need to go back and refer to those who get it!
Sort
- The running time of quicksort can be improved in practice by taking advantage of the fast running time of insertion sort when its input is “nearly” sorted. When quicksort is called on a subarray with fewer than k elements, let it simply return wi
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
ARMA-Java--master
- ARIMA模型是通过将预测对象随时间推移而形成的数据序列当成一个随机序列，进而用一定的数学模型来近似表述该序列。根据原序列是否平稳以及回归中所包含部分的不同分为AR、MA、ARMA以及ARIMA过程。 在模型的使用过程中需要根据时间序列的自相关函数、偏自相关函数等对序列的平稳性进行判别；而对于非平稳序列一般都需要通过差分处理将其转换成平稳序列（ARIMA）；对得到的平稳序列进行建模以确定最佳模型（AR、MA、ARMA或者ARIMA）。在使用中最重要也是最关键的就是对序列进行参数估计，以检验其
java网络爬虫
- 是一个无须配置、便于二次开发的JAVA爬虫框架（内核），它提供精简的的API，只需少量代码即可实现一个功能强大的爬虫(Is a JAVA reptile framework (kernel) that does not need to be configured for easy development. It provides a streamlined API that requires a small amount of code to implement a powerful crawl