Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.
标签： interesting Traveling classical Salesman
上传时间： 2016-02-06
上传用户：rocwangdp
How the K-mean Cluster work Step 1. Begin with a decision the value of k = number of clusters Step 2. Put any initial partition that classifies the data into k clusters. You may assign the training samples randomly, or systematically as the following: Take the first k training sample as single-element clusters Assign each of the remaining (N-k) training sample to the cluster with the nearest centroid. After each assignment, recomputed the centroid of the gaining cluster. Step 3 . Take each sample in sequence and compute its distance from the centroid of each of the clusters. If a sample is not currently in the cluster with the closest centroid, switch this sample to that cluster and update the centroid of the cluster gaining the new sample and the cluster losing the sample. Step 4 . Repeat step 3 until convergence is achieved, that is until a pass through the training sample causes no new assignments.
标签： the decision clusters Cluster
上传时间： 2013-12-21
上传用户：gxmm
压缩解压算法LZ77算法有许多派生算法(这里面包括 LZSS算法)。它们的算法原理上基本都相同，无论是哪种派生算法，LZ77算法总会包含一个动态窗口（Sliding Window）和一个预读缓冲器（Read Ahead Buffer）。动态窗口是个历史缓冲器，它被用来存放输入流的前n个字节的有关信息。一个动态窗口的数据范围可以从 0K 到 64K，而LZSS算法使用了一个4K的动态窗口。预读缓冲器是与动态窗口相对应的，它被用来存放输入流的前n个字节，预读缓冲器的大小通常在0 – 258 之间。这个算法就是基于这些建立的。用下n个字节填充预读缓存器（这里的n是预读缓存器的大小）。在动态窗口中寻找与预读缓冲器中的最匹配的数据，如果匹配的数据长度大于最小匹配长度 （通常取决于编码器，以及动态窗口的大小，比如一个4K的动态窗口，它的最小匹配长度就是2），那么就输出一对〈长度（length），距离（distance）〉数组。长度(length)是匹配的数据长度，而距离(distance)说明了在输入流中向后多少字节这个匹配数据可以被找到。
上传时间： 2014-01-22
上传用户：tzl1975
Kriging 插值程序，实现二维三维数据插值 Makefile_hp700 Makefile_ibm6000 kriging.mdf kriging.c outboard.c inv_m.tar.gz The inverse matrix source codes which got from Netlib. f2c.tar.gz The head file and library which are used to inverse matrix source codes. krig.net The example dx file. data1.dx The input example.
上传时间： 2016-03-27
上传用户：缥缈
Basic hack v2.1 by xgx - http://www.ring0.donster.de/ Features: - Smooth Vector Aimbot - Full ESP ( Namen,Weapon,Distance,Visible,Far) - polymorph,peb hiding to prevent VAC detection
标签： Features donster Aimbot Smooth
上传时间： 2013-12-18
上传用户：agent
51 single slice the practical procedure database of the machine, can let the raw recruit convenient plait distance with adjust to use
标签： the convenient practical procedure
上传时间： 2016-04-10
上传用户：jqy_china
Probability distribution functions. estimation - (dir) Probability distribution estimation. dsamp - Generates samples from discrete distribution. erfc2 - Normal cumulative distribution function. gmmsamp - Generates sample from Gaussian mixture model. gsamp - Generates sample from Gaussian distribution. cmeans - C-means (or K-means) clustering algorithm. mahalan - Computes Mahalanobis distance. pdfgauss - Computes probability for Gaussian distribution. pdfgmm - Computes probability for Gaussian mixture model. sigmoid - Evaluates sigmoid function.
标签： distribution Probability estimation functions
上传时间： 2016-04-28
上传用户：13188549192
In this paper, we present LOADED, an algorithm for outlier detection in evolving data sets containing both continuous and categorical attributes. LOADED is a tunable algorithm, wherein one can trade off computation for accuracy so that domain-specific response times are achieved. Experimental results show that LOADED provides very good detection and false positive rates, which are several times better than those of existing distance-based schemes.
标签： algorithm detection containi evolving
上传时间： 2014-01-08
上传用户：aeiouetla
c的快速傅立叶变换程序包，the file FFT.ZIP contains C source code for performing Discrete Fast Fourier Transforms (DFFTs) and inverse DFFTs.
上传时间： 2014-01-07
上传用户：Altman
（1） 实现一个Point类，该类包含表示坐标的两个int型变量x、y，构造方法Point()和Point(int xx, int yy),返回x值和y值的int getX()和int getY()方法，计算两点间距离的double distance(Point)方法。其中计算平方根用Math.sqrt()方法。 （2） 实现一个Circle类，该类包含表示圆心的Point型变量center，表示半径的int radius变量，以及构造方法Circle()、Circle(int xx,int yy,int r)、Circle(Point c,int r)，返回周长和面积的int perimeter()、double area()方法，返回两个圆是否为同一个圆（返回0）、同心圆（返回1）、相交的圆（返回2）、分离的圆（返回3）、包含的圆（返回4）等关系的int relation(Circle c)等方法。PI值可以用Math.PI常量。 （3） 实现测试上述两个类的ClassTest类。该类在main方法中分别创建若干个Point对象和Circle对象，并调用相关方法，输出方法的返回值，验证其正确性。 （4） 将Point类、Circle类和主类的包名分别调整为p1、p2、p3，并重新运行，验证是否运行正确。
标签： Point
上传时间： 2014-11-25
上传用户：cylnpy
