<abbr id="u4oue"></abbr>
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.
標(biāo)簽： interesting Traveling classical Salesman
上傳時(shí)間： 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.
標(biāo)簽： the decision clusters Cluster
上傳時(shí)間： 2013-12-21
上傳用戶：gxmm
壓縮解壓算法LZ77算法有許多派生算法(這里面包括 LZSS算法)。它們的算法原理上基本都相同，無論是哪種派生算法，LZ77算法總會(huì)包含一個(gè)動(dòng)態(tài)窗口（Sliding Window）和一個(gè)預(yù)讀緩沖器（Read Ahead Buffer）。動(dòng)態(tài)窗口是個(gè)歷史緩沖器，它被用來存放輸入流的前n個(gè)字節(jié)的有關(guān)信息。一個(gè)動(dòng)態(tài)窗口的數(shù)據(jù)范圍可以從 0K 到 64K，而LZSS算法使用了一個(gè)4K的動(dòng)態(tài)窗口。預(yù)讀緩沖器是與動(dòng)態(tài)窗口相對應(yīng)的，它被用來存放輸入流的前n個(gè)字節(jié)，預(yù)讀緩沖器的大小通常在0 – 258 之間。這個(gè)算法就是基于這些建立的。用下n個(gè)字節(jié)填充預(yù)讀緩存器（這里的n是預(yù)讀緩存器的大小）。在動(dòng)態(tài)窗口中尋找與預(yù)讀緩沖器中的最匹配的數(shù)據(jù)，如果匹配的數(shù)據(jù)長度大于最小匹配長度 （通常取決于編碼器，以及動(dòng)態(tài)窗口的大小，比如一個(gè)4K的動(dòng)態(tài)窗口，它的最小匹配長度就是2），那么就輸出一對〈長度（length），距離（distance）〉數(shù)組。長度(length)是匹配的數(shù)據(jù)長度，而距離(distance)說明了在輸入流中向后多少字節(jié)這個(gè)匹配數(shù)據(jù)可以被找到。
上傳時(shí)間： 2014-01-22
上傳用戶：tzl1975
Kriging 插值程序，實(shí)現(xiàn)二維三維數(shù)據(jù)插值 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.
上傳時(shí)間： 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
標(biāo)簽： Features donster Aimbot Smooth
上傳時(shí)間： 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
標(biāo)簽： the convenient practical procedure
上傳時(shí)間： 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.
標(biāo)簽： distribution Probability estimation functions
上傳時(shí)間： 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.
標(biāo)簽： algorithm detection containi evolving
上傳時(shí)間： 2014-01-08
上傳用戶：aeiouetla
c的快速傅立葉變換程序包，the file FFT.ZIP contains C source code for performing Discrete Fast Fourier Transforms (DFFTs) and inverse DFFTs.
上傳時(shí)間： 2014-01-07
上傳用戶：Altman
（1） 實(shí)現(xiàn)一個(gè)Point類，該類包含表示坐標(biāo)的兩個(gè)int型變量x、y，構(gòu)造方法Point()和Point(int xx, int yy),返回x值和y值的int getX()和int getY()方法，計(jì)算兩點(diǎn)間距離的double distance(Point)方法。其中計(jì)算平方根用Math.sqrt()方法。 （2） 實(shí)現(xiàn)一個(gè)Circle類，該類包含表示圓心的Point型變量center，表示半徑的int radius變量，以及構(gòu)造方法Circle()、Circle(int xx,int yy,int r)、Circle(Point c,int r)，返回周長和面積的int perimeter()、double area()方法，返回兩個(gè)圓是否為同一個(gè)圓（返回0）、同心圓（返回1）、相交的圓（返回2）、分離的圓（返回3）、包含的圓（返回4）等關(guān)系的int relation(Circle c)等方法。PI值可以用Math.PI常量。 （3） 實(shí)現(xiàn)測試上述兩個(gè)類的ClassTest類。該類在main方法中分別創(chuàng)建若干個(gè)Point對象和Circle對象，并調(diào)用相關(guān)方法，輸出方法的返回值，驗(yàn)證其正確性。 （4） 將Point類、Circle類和主類的包名分別調(diào)整為p1、p2、p3，并重新運(yùn)行，驗(yàn)證是否運(yùn)行正確。
標(biāo)簽： Point
上傳時(shí)間： 2014-11-25
上傳用戶：cylnpy
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
