代碼大全第二版中文版，分量有多重兄弟們應(yīng)該很明白。由于加密原因，用adobe reader 7.0以上的版本打開。
標(biāo)簽： 代碼大全
上傳時間： 2015-07-01
上傳用戶：wuyuying
This is SvmFu, a package for training and testing support vector machines (SVMs). It s written in C++. It uses templates. The advantage of templates is that the types of kernel values and data points can be varied to suit the problem.
標(biāo)簽： machines training package testing
上傳時間： 2015-07-03
上傳用戶：zhengzg
窗口上的文本行顯示當(dāng)前文件的路徑，文本區(qū)用于編輯文件，3個按鈕 [打開]，[保存…],[另存為…]。 單擊[打開]按鈕時，彈出打開文件對話框，將選擇的文件顯示在文本區(qū)中。 單擊[保存…]按鈕時，如果當(dāng)前文件為空，則彈出保存文件對話框，并按設(shè)置的文件名保存文件；如果已有文件，則按設(shè)置的文件名保存文件。 單擊[另存為…]按鈕時，則彈出保存文件對話框，并按設(shè)置的文件名保存文件。 程序中以字符文件輸出流FileWriter的writer方法寫入文本區(qū)內(nèi)容，以字符緩沖輸入流BufferedReader的readLine()方法按行讀取文本文件。
上傳時間： 2013-11-30
上傳用戶：皇族傳媒
A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.
標(biāo)簽： optimization demonstrate the traveling
上傳時間： 2015-07-12
上傳用戶：偷心的海盜
This demo nstrates the use of the reversible jump MCMC simulated annealing for neural networks. This algorithm enables us to maximise the joint posterior distribution of the network parameters and the number of basis function. It performs a global search in the joint space of the parameters and number of parameters, thereby surmounting the problem of local minima. It allows the user to choose among various model selection criteria, including AIC, BIC and MDL
標(biāo)簽： This reversible annealing the
上傳時間： 2015-07-19
上傳用戶：ma1301115706
java如何解析xml，一個xml reader的例子，可以讀unicode字符
上傳時間： 2013-12-17
上傳用戶：thesk123
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
標(biāo)簽： introduction the contains intended
上傳時間： 2013-12-23
上傳用戶：liansi
考試是教學(xué)過程中一個重要的環(huán)節(jié),對考試試卷質(zhì)量及考試成績及時、有效地分析,是教學(xué)管理部門非常重要的工作內(nèi)容之一。文章從教學(xué)管理策劃和教學(xué)管理軟件開發(fā)角度,探討了計算機(jī)和OMR(opticalmark reader)技術(shù)在考試分析中的應(yīng)用和實(shí)現(xiàn),并給出一個具體的自動閱卷和分析系統(tǒng)實(shí)例的設(shè)計原理和開發(fā)過程。
標(biāo)簽： opticalmark OMR 過程 環(huán)節(jié)
上傳時間： 2014-01-12
上傳用戶：lixinxiang
CarSim is an application for the simulating the (simplified) movement of cars on a two-dimensional surface. Package ope.carsim contains classes that represent the problem domain: cars and locations. Package ope.carsim.gui contains a user interface for the application.
標(biāo)簽： two-dimensional application simulating simplified
上傳時間： 2013-12-22
上傳用戶：gaome
it contains many classic Test Problems for Unconstrained Optimization such as camel6,treccani,goldstein,branin, shubert1,Ackley,dejong,dejong1,dejong2, dpower,rastrigin,Griewangk,Schwefel, rosenbrock2 and step. the package have the contour and mesh figures of these problem. it also give m files of these problems,and you can easily get your view of figures.
標(biāo)簽： Unconstrained Optimization contains Problems
上傳時間： 2015-09-17
上傳用戶：bcjtao
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
