Using vc platform development dual Lagrange interpolation procedures can be...

***

bm算法的delphi实现-bm algorithm to achieve the delphi

第六章 树和二叉树习题答案-The answer of tree and binary tree

旅行商问题 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。 例如：给定4个城市{1，2，3，4}及其各城市之间的路程 最优路线是1,3,2,4,1， 其最短路程是25-a salesman, traveling salesman problem, a number of cities to sell commodities, the known distance between the city (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. For example : given four cities (1,2,3,4) and the distance between the city optimal route is 1,3,2,4, 1, the shortest distance is 25

是数据挖掘实验课上的一个作业，垃圾邮箱分类，给了57个属性1个分类目标，0是垃圾邮箱1不是，给了训练集和测试集，用的C++写的神经网络，并用遗传算法优化了，正确率96.5%，但是时间较长

这是一个我亲自开发的拼音和台湾注音输入法,运行很好，效率高.有声调,加入main函数调用py_ime函数即可-This is a development I personally and Taiwan phonetic Pinyin input method, running good, high efficiency. A song. joined the main function call can function py_ime

Bellman Ford algorithm for finding the shortest path between nodes is an algorithm used.  primarily in the gray box identifies nodes are between our EDGE. Then we set the starting node (for one example)  resulting path will be drawn on lef

该程序是用来画微分系统时间序列图相图等相关的图形的,可以很好的对一个微分系统进行分析-The program is used to draw the time-differential phase diagram sequence diagram of the graphics, etc., can be a very good system for a differential analysis

应用背景aplikasi神经网络，为工作上syaraf tiruan数据网。关键技术计算机智能化，penalaran电脑，komputasi，INI tugas matakuliah

图论中使用分支与界法求解旅行商问题，直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run