c++学习初步

基于ELMAN神经网络对阶跃响应动态进行补偿也可以举一反三的运用于ELMAN网络的其他应用-Elman neural network based on the step response of the dynamic compensation can be applied to an example of the Elman network other applications

首先采用某种编码方式将解空间映射到编码空间，每个编码对应问题的一个解，称为染色体或个体。一般通过随机方法确定起始的一群个体，称为种群，在种群中根据适应值或某种竞争机制选择个体，使用各种遗传操作算子产生下一代如此进化下去，直到满足期望的终止条件。-begin using some form of coding mapping to the solution space coding space, each encoding a corresponding solution to the problem, known as chromosome or individual. General randomly determined by the initial group of individuals, called stocks, the stocks based on fitness or some mechanism to choose the individual competition, the use of genetic Operator evolution of the next generation so on, until the termination meet expectations conditions.

人工智能GA问题的C语言实现，已经调试通过，含源程序和实验报告-the C language, debugging, and experiment with the source report

< 网络机器人java编程指南>>的配套源程序，研究如何实现具有Web访问能力的网络机器人的书。从Internet编程的基本原理出发，深入浅出、循序渐进地阐述了网络机器人程序Spider、Bot、Aggregator的实现技术，并分析了每种程序的优点及适用场合。本书提供了大量的有效源代码，并对这些代码进行了详细的分析。通过本书的介绍，你可以很方便地利用这些技术，设计并实现网络蜘蛛或网络信息搜索器等机器人程序。-lt; Lt; Java Web Robot Programming Guide gt; Gt; The matching source to study how to achieve the ability to visit the Web network robot book. Internet programming from the basic principles and simple, step by step elaborate procedures of the network robot Spider, Bot, aggregator of technology, and analysis of the merits of each procedure and applicable occasions. The book provides plenty of source code, as well as code for a detailed analysis. Through the book, you can easily take advantage of these technologies, network design and network information spider or other search engine robot procedures.

我们解决八数码问题,广度优先搜索可能会导致内存不够用,采用启发式搜索,启发函数为f(x)=g(x)+h(x) g(x)为该结点不同于目标结点的个数,h(x)为该结点的深度,选择那f(x)结点最小的那个结点进行扩展, 引入了一个"扩展数组[4]"(因为扩展的结点最多只有4个),该数组保存着某个结点的0点向各个方向的扩展的结点对象,然后对该扩展数组进行分析,利用启发函数在进行递归扩展... -us solve eight digital, BFS may lead to insufficient memory, using heuristic search, heuristic function f (x) = g (x) h (x) g (x) for the target node is different from the number of nodes, h (x) for the nodes of depth, the choice between f (x) nodes that the smallest node expansion. the introduction of an "expanded array [4]" (because the expansion of the nodes at most four), The array maintains a node of 0:00 a.m. to expand in all directions in the target node, and then expanded array analysis, use heuristic function during recursive expansion ...

bayes network 的分三角形的算法-bayes network breakdown triangle algorithm

K-Means动态聚类算法源程序 使用K-Means实现数据挖掘中的聚类算法-Dynamic K-Means clustering algorithm source realize the use of K-Means clustering data mining algorithm

基于Matlab的简单遗传算法和简单bp网络的程序实现-based on Matlab simple genetic algorithms and simple bp Network Program

遗传免疫是算法的程序 大家可以看看 遗传免疫算法 我也是刚开始学 传上去大家共同学习-Genetic immunization is a method of procedure we will look at the genetic immune algorithm I am also just beginning to learn Chuan-up of common learning

麻省理工大学遗传算法 -Massachusetts Institute of Technology Massachusetts Institute of Technology genetic algorithm genetic algorithm