Search - iteration

Search - iteration - List

[Other resource] MFCIteratorDemo DL : 0: 这个项目演示了STL风格的迭代子，如何编写自己的迭代子，使用容器来简化STL，并与STL兼容。在这个例子中使用的容器是MFC框架应用程序，文档模板，文档类CWinApp,-the project demonstrated the STL - style iteration, how to prepare their son iteration, the use of containers to simplify the STL, and compatible with the STL. In this example is the use of containers MFC framework applications, document templates, document type CWinApp.
Date : 2008-10-13 Size : 26.08kb User : 张雷
[Other resource] srcV0624 DL : 0: 这个代码是policy iteration算法关于强化学习的. 请您用winzip 解压缩-policy iteration algorithm for enhanced learning. Please use winzip decompress
Date : 2008-10-13 Size : 18.24kb User : 柳春
[Other resource] 单片机子程序库 DL : 0: 目前已有若干版本的子程序库公开发表，它们各有特色。本程序库中的开平方算法为快速逼近算法，它能达到牛顿迭代法同样的精度，而速度加快二十倍左右，超过双字节定点除法的速度.-there are several versions of the subroutine library published their own characteristics. The library opened in the square approximation algorithm for rapid algorithm, it will reach Newton iteration of the same accuracy, while speed about 20 times, more than double byte sentinel division speed.
Date : 2008-10-13 Size : 2.86kb User : 王辉
[Other resource] Iterator基本原则 DL : 0: 有效使用STL迭代器ITERATOR的三条基本原则，是C/C++ Users Journal摘录的Effective STL的三个独立条款-effective use of STL ITERATOR iteration for the three basic principles, C / C Users Journal Effective STL extract of the three separate articles
Date : 2008-10-13 Size : 38.88kb User : gee
[Other resource] dossier DL : 0: For the incomplete methods, we kept the representation of the queens by a table and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems than the representation by a matrix. heuristics: descent. Tests: 100 queens in less than 1 second and 67 iterations. 500 queens in 1 second and 257 iterations. 1000 queens in 11 seconds and 492 iterations. heuristics: Simulated annealing. Tests: 100 queens in less than 1 second and 47 iterations. 500 queens in 5 seconds and 243 iterations. 1000 queens in 13 seconds and 497 iterations. heuristics: based on Simulated Annealing. Tests: 100 queens in less than 1 second and 60 iterations. 500 queens in 1 second and 224 iterations. 1000 queens in 5 seconds and 459 iterations. 10 000 queens in 20 minutes 30 seconds and 4885 iterations. -For the incomplete methods, we kept the representation of the queens by a tab le and the method of calculation to determine if two queens are in conflict, which is much faster for this kind of problems th an the representation by a matrix. heuristics : descent. Tests : 100 queens in less than a second and 67 iteration s. 500 queens in a second and 257 iterations. 100 queens 0 in 11 seconds and 492 iterations. heuri stics : Simulated annealing. Tests : 100 queens in less than a second and 47 iteration s. 500 queens in 5 seconds and 243 iterations. 10 00 queens in 13 seconds and 497 iterations. heur istics : based on Simulated Annealing. Tests : 100 queens in less than a second and 60 iteration s. 500 queens in a second and 224 iterations. 100 0 queens in 5 seconds and 459 iterations. q 1
Date : 2008-10-13 Size : 51.35kb User : ZHU
[Other resource] Cprograms DL : 0: 中南大学C语言程序设计实习 1 实验一：C语言图形模式的设置 2 实习二：一元函数的图形绘制 3 实习三：二维图形的几何变换 4 实习四：非线性方程求根的二分法 5 实习五：非线性方程求根的牛顿法 6 实习六：数值积分的矩形法和梯形法 7 实习八：级数求和问题 8 实习九：曲线拟合 9 实习十一：解线性方程组的Gauss消元法 10 实习十四：解线性方程组的Jacobi迭代法 11 实习十六：空间曲面和曲线的绘制 12 实习十七：Hanoi塔问题 13 实习十八：综合问题 -Zhongnan University C Programming Language internship an experimental one : C language graphics model of the provision of two internships 2 : 1 yuan function graphic attachment 3 3 : 2D geometry transform four interns 4 : nonlinear equation Root dichotomy five interns 5 : nonlinear equation Root cattle Dayton law internship 6 6 : numerical integration of rectangular and trapezoidal Law Practice Act 7 8 : series summation internship 9 8 : 9 curve fitting attachment 11 : Solving Linear Equations of Gaussian Elimination Act 10 interns 14 : Solving Linear Equations Jacobi iteration 11 interns 16 : space curves and surfaces Drawing 12 interns 17 : Hanoi Tower 13 interns 18 : Comprehensive problems
Date : 2008-10-13 Size : 164.38kb User : CF雷电
[Other resource] immunity DL : 1: 提供一个人工免疫算法源程序，其算法过程包括： 1.设置各参数 2.随机产生初始群体——pop=initpop(popsize,chromlength) 3.故障类型编码，每一行为一种！code(1,:)，正常；code(2,:)，50％；code(3,:)，150％。实际故障测得数据编码，这里Unnoralcode,188％ 4.开始迭代（M次）： 1）计算目标函数值：欧氏距离[objvalue]=calobjvalue(pop,i) 2）计算群体中每个个体的适应度fitvalue=calfitvalue(objvalue) 3）选择newpop=selection(pop,fitvalue) objvalue=calobjvalue(newpop,i) ％交叉newpop=crossover(newpop,pc,k) objvalue=calobjvalue(newpop,i) ％变异newpop=mutation(newpop,pm) objvalue=calobjvalue(newpop,i) ％ 5.求出群体中适应值最大的个体及其适应值 6.迭代停止判断。-provide a source of artificial immune algorithm, the algorithm process include : 1. Two of the parameters set. Initial randomly generated groups -- pop = initpop (popsize, chromlength) 3. Fault type coding, each act a! Code (1 :), normal; Code (2, :), 50%; Code (3 :), 150%. Fault actual measured data coding, here Unnoralcode, 188% 4. Beginning iteration (M) : 1) the objective function value : Euclidean distance [objvalue] = calobjvalue (pop, i) 2) calculation of each individual groups of fitness calfitvalue fitvalue = ( objvalue) 3) = newpop choice selection (pop, fitvalue) objvalue = calobjvalue (newpop, i) =% newpop cross-crossover (newpop, pc, k) = calobjvalue objvalue (newpop, i) =% variation newpop mutation (newpop, pm ) objvalue = calobjvalue (newpop, i)% 5. groups sought to adapt th
Date : 2008-10-13 Size : 8.8kb User : 江泉
[Other resource] SORxx DL : 0: 雅可比、塞德尔和SOR迭代法的原理。代法的原雅可比、塞德尔和SOR迭代法的原理。理。-Jacobian, Seidel and SOR Diez Jacobian, Seidel SOR iteration method and the principle. On behalf of the original law Jacobian, Seidel SOR iteration method and the principle. Jimmy.
Date : 2008-10-13 Size : 2.51kb User : 张名
[Other resource] PSO-C DL : 0: 在C语言环境下使用的粒子群优化算法，需要给出最大速度、迭代次数、作为中断条件的最小误差等初始条件。-in the C-language environment to the use of the PSO algorithm, the greatest need is speed, the number of iteration, as the smallest disruption error conditions such as initial conditions.
Date : 2008-10-13 Size : 57.02kb User : 刘方
[Other resource] Ygpc DL : 0: 像片外方位元素计算程序，根据已知坐标数据和最小二乘原理进行间接平差，得到外方位元素的改正数，迭代求解-porno elements outside position calculation procedures, according to the known coordinates data and the principle of least squares indirect adjustment, outside the position to be the correct number of elements, iteration
Date : 2008-10-13 Size : 43.76kb User : 董万峰
[Other resource] team16i1_1 DL : 0: 采用XP极限开发方法进行软件开发时，进行语音通信软件开发写的软件工程的迭代计划（第一次迭代）-Limit use XP development method for software development, voice communications software written in the iterative software engineering (first iteration)
Date : 2008-10-13 Size : 229.06kb User : 李天
[Other resource] FLOW1 DL : 0: C语言牛拉法潮流计算程序．包括导纳矩阵形成，牛拉法迭代．-C language Rafah cattle flow calculation procedures. Including admittance matrix formation, cattle Rafah iteration.
Date : 2008-10-13 Size : 6.57kb User : 李
[Other resource] Subspace DL : 1: 子空间迭代算法求解结构的特征值，对结构动力分析必须的基本代码，希望对大家有用。-subspace iteration algorithm for the eigenvalue structure, the structural dynamic analysis must be the basic code we hope that the right useful.
Date : 2008-10-13 Size : 1.93kb User : stefanie
[Other resource] iterative_SOR DL : 0: 这是一个迭代法实现的C代码。本算法采用的是SOR迭代法。-This is an iterative method to achieve the C code. This algorithm is used SOR iteration.
Date : 2008-10-13 Size : 955byte User : 宋亚平
[Other resource] bipso DL : 0: 围绕粒子群的当前质心对粒子群重新初始化.这样，每个粒子在随后的迭代中将在新的位置带着粒子在上次搜索中获得的“运动惯性”（wvi）向Pi，Pg的方向前进，从而可以在粒子群的运动过程中获得新的位置，增加求得更优解的机会.随着迭代的继续，经过变异的粒子群又将趋向于同一点，当粒子群收敛到一定程度时又进行下一次变异，如此反复，直到迭代结束.-particle swarm around the center of mass of the current PSO reinitialization. Thus, Each particle in the next iteration will be in the new location with particles in the last search was the "inertia" (wvi ) Pi, Pg orientation, and thus can PSO course of the campaign was a new position, increase seek better solutions opportunities. With the continued iteration, after variation of PSO will tend to the same point. When PSO converge to a certain extent when the next variation, so repeatedly, until the end of iteration.
Date : 2008-10-13 Size : 75.69kb User : wanglg
[Other resource] atan_base_on_CORDIC_arithmetic DL : 0: 用CORDIC算法实现的2参数反正切。结果的精度与CORDIC的迭代次数有关，迭代次数越多，精度越高。本例子中精确到小数点后4位。要提高迭代次数，还得把增加1QN格式的位数，比如32位long，程序多处需要修改，有需要的话自己改吧。 -CORDIC algorithm with the two parameters arc tangent. And the accuracy of the CORDIC iteration number, the more the number of iteration, the higher the accuracy. This case accurate to four decimal places. To raise the number of iterations, it has to the increase in a 2:30 format of the median, such as 32 long, multiple procedures need to change, the need to reform it themselves.
Date : 2008-10-13 Size : 1.88kb User : 陈朋
[Other resource] newton_iter DL : 0: 牛顿迭代法的C++类，数值计算很实用的封装类，可以作为数值计算应用软件的一部分使用-Newton iteration of the C - numerical very practical Packaging category, Numerical calculations can be used as part of the application software use
Date : 2008-10-13 Size : 1.47kb User : 任平生
[Other resource] Fixed_pt DL : 0: matlab语言开发的图像去噪的固定点迭代法，基于偏微分方程的一个算法。-Matlab language Image Denoising fixed-point iteration method, based on partial differential equations of an algorithm.
Date : 2008-10-13 Size : 2.01kb User : wjc
[Other resource] invGreville DL : 0: 矩阵的广义逆计算，共两种方法，其中迭代法有一阶收敛和二阶收敛-generalized inverse matrix calculation, a total of the two methods, which iteration is a second-order convergence and convergence
Date : 2008-10-13 Size : 1.67kb User : lixuan
[Other resource] Machin DL : 0: 复化simponson求积数值分析算法之复化simpson求积算法，详细情形请见源程序,,Visual C++ my赛德尔迭代法.rar - 在VC++实现的赛德尔迭代法，有每次迭代的结果,,Visual C++ -complex plot of simponson for numerical analysis algorithm from a plot of simpson seeking algorithm, details, see the source,, Visual C my Seidel iterative method. rar-in the VC Seidel iterative method, with each iteration of the results, Visual C
Date : 2008-10-13 Size : 2.67kb User : 李前

« 12 3 »