搜索资源列表
uselinklist
- 分治算法解决一维点对最小距离-partition algorithm to solve one-dimensional point of minimum distance
commapi
- java通过串口或USB口调用短信猫收、发短信DEMO及API-The examples in this document assume that you have unzipped the commapi.zip file in your C: partition and your JDK installation is in C:\jdk1.1.6. If you have installed JDK in an other location or unzipped javacomm20-w
CPair
- 分治法寻找最接近点对,内附测试文件，算法分析与设计作业-Partition method to find the most close point ，Enclosed test files, the algorithm analysis and design work
skyline
- 城市轮廓线问题的实现，利用分治算法，将input1.dat文件放在d盘根目录下-Urban contour implementation issues, using the partition algorithm, the input1.dat files under the root directory on the d
FileDivisionUniter
- 文件分割合并器，将大文件分割成若干小文件；将多个小文件合并到一个大文件。-Partition merge document, and will split large files into several small files multiple small files into one large file.
jFmenu
- Java文件分割合并工具,能实现文件的合并与分割.-Java file split merge tool, to achieve the merger of paper and partition.
FileOs
- 一个JAVA的文件分割器，可以把一个文件分成N份，并且还可以整合，以后可以利用它把文件分好后存在自己的邮件里啦-JAVA partition a document, you can put a file into N copies, and also can be integrated, then you can use it to document the existence of its own after a good e-mail you. . .
checkuser
- 验证用户信息，电子邮件，地址是否合法 身份证验证，性别验证..... 支持[数据导入]（导入格式用空格或逗号或竖线|分割字段），并验证导入数据 firefox\ie测试通过。-Validate the user information, e-mail, address, ID card to verify the legality, gender verification ..... Supporting [Data Import] (Import format by a space
filesplitter
- 图形界面swing 实现文件分割，确定分割的大小与分割数量，并且可以合并文件-Graphical interface for file segmentation swing to determine the partition size and the number of partitions, and files can be merged
java_File_filter
- Java编写的一个文件分割工具的源代码，值得看一下！-Java prepared a file partition tool' s source code, it is worth a look!
Partition
- Print out all partitions of a positive integer N. In number theory, a partition of N is a way to write it as a sum of positive integers. Two sums that differ only in the order of their terms are considered the same partition. Example: jav
java_code_of_algorithms
- 各种数据结构算法的java代码实现，包括选择排序、快速排序、分区算法、dfs、mst等18个算法的java代码。-Various data structure algorithms java code to achieve, including the selection sort, quick sort, partition algorithm, dfs, mst in 18 algorithm java code.
123456789
- 归并排序(merge sort)体现了分治的思想，即将一个待排序数组分为两部分，对这两个部分进行归并排序，排序后，再对两个已经排序好的数组进行合并。这种思想可以用递归方式很容易实现。归并排序的时间复杂度为O(nlogn)，空间复杂度为O(n)。-Merge sorting (merge sort) embodies the idea of partition, about an array to be sorted into two parts, the two parts merge sort
dynamicSubareaManage
- 动态分区存储管理方式的模拟与实现 1、分配算法 首次适应算法、循环首次适应算法、最佳适应算法、最坏适应算法 2、回收策略 -Dynamic partition memory management and implementation of a simulation, the first fit algorithm allocation algorithm, the first cycle adaptation algorithm, the best fit algorithm,
java-getDisk
- java做的获取电脑的主板ID和硬盘分区编号。-java to do to get the computer' s motherboard ID and hard disk partition number.
MatrixMultiply
- 用分治法和Strassen方法，并进行效率的比较，有图形界面，输出结果用log4j输出到文件中。-With partition and Strassen method, and comparison of the efficiency, has a graphical interface, using log4j output the results output to a file
Partition
- 集合划分问题。给定正整数 n，计算出n 个元素的集合{1,2, , n }可以划分为多少个不同的非空子集。-Set partitioning problem. Given a positive integer n, calculate the n elements of the set {1,2, , n} can be divided into a number of different non-empty sets.
helix-0.6.0-incubating-src
- Helix 是一个通用的集群管理框架，用于自动化的分区、复制和资源分布，提供如下特性： 1.Automatic assignment of resource/partition to nodes 2.Node failure detection and recovery 3.Dynamic addition of Resources 4.Dynamic addition of nodes to the cluster 5.Pluggable distributed state
KDTree
- k-d树（k-dimensional树的简称），是一种分割k维数据空间的数据结构。主要应用于多维空间关键数据的搜索（如：范围搜索和最近邻搜索）。用java实现，可直接运行-kd-tree (k-dimensional tree for short), is a partition the data structure of k-dimensional data space. Mainly used in the search of the key data of the multidimensi
linear-partition-master
- Linear Partition of the layout