Search - iteration

Search - iteration - List

[Software Engineering] 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 : 2025-12-31 Size : 229kb User : 李天
[Software Engineering] CLangue DL : 0: 数值计算方法在C语言中的应用介绍了数值计算方法与计算机程序语言相结合的重要性，在给出牛顿迭代公式之后，阐述了牛顿迭代法在do-while循环中的应用，然后通过实例基于曲线梯形面积求解方法，论述了矩形法和梯形法在for循环中的应用．最后指出：用正确的数值计算方法编写高效的计算机程序解决复杂的实际问题应成为当代理工科大学生必备的基础与技能-numerical calculation method in the C language to the application of numerical methods and computer programming language combined weight in particular, given the Newton iterative formula, explained Newton iteration in do-while loop, the application Then examples curve trapezoid area based solution discussed rectangular and trapezoidal method for the application cycle. Finally : with the correct numerical method to prepare efficient computer programs to solve complex practical problems should become contemporary science and engineering students essential infrastructure and skills
Date : 2025-12-31 Size : 156kb User : liming
[Software Engineering] Multi2vendorSelectionModelforMulti2product DL : 0: 为解决供应链中多品种供应的多供应商选择问题,建立了以供应综合成本最低为目标函数、满足多个约束条件的组合优化模型. 为解决求解的困难,采用变换分解算法,将原模型转换为整数规划问题. 根据不同迭代方式,给出了2种基本运算步骤1在算例中运用模型和算法,得到了多物资供应环境下多供应商的最优任务分派1新方法克服了常规供应商的选择评价方法只针对单一物资供应过程和面向单一供应商选择过程的局限性.-To solve the multi2vendor selection p roblem in a multi2p roduct supp ly chain, an op timization mode was constructed with the lowest composite cost taken as the objective function and with necessary constraints. A decomposing algorithm was used to overcome the difficulty in solving the model. The original model was transformed into an integer p rogramming model. Based on different iteration p rocedure, two algorithms were p resented. The model and algorithms were app lied in a numeral examp le, and an op timized assignment of the p roducts was obtained. The p roposed method overcomes the limitation in the conventional vendor evaluation models where only single p roduct or single vendor is considered.
Date : 2025-12-31 Size : 244kb User : 李学兵
[Software Engineering] RUP DL : 0: 软件工程的RUP模板，用于在初始迭代以及构架过程中各个文档的书写，均为中文版-RUP software engineering template used in the initial iteration, as well as the various documents in the framework of the process of writing, both English Version
Date : 2025-12-31 Size : 497kb User : Air
[Software Engineering] newton-MATLAB DL : 0: 详细推导了复平面上牛顿迭代法的原理和计算公式，用MATLAB编程实现了牛顿迭代法，得到一些奇异绚丽的分形图形-The complex plane is derived in detail the principle and Newton' s iteration formula, using MATLAB programming Newton' s iterative method, get some strange colorful fractal images
Date : 2025-12-31 Size : 1.34mb User : wanglei
[Software Engineering] lysnake DL : 0: 提出了一种自适应的Snake 算法,对于初始包络上的每一点,按照Greedy 算法中的能量公式计算其邻域内各点的能量. 如果邻域不包含目标的轮廓,则将邻域半径加大,再次计算邻域内各点的能量,直到邻域内包含轮廓点为止. 该算法只需迭代一次即可得到目标轮廓,而且增大了初始包络的收敛半径,并能够有效处理较高曲率凸形边缘的情况. 对比实验说明了这种方法的有效性.-Snake proposed an adaptive algorithm, the initial envelope for each point on, in accordance with the Greedy algorithm in the energy formula of the neighborhood points of energy. If the neighborhood does not contain the target contour, the radius will be neighborhood increased, again the neighborhood of the points of energy, until the neighborhood of the contour points so far included. The algorithm only one iteration object contours can be obtained, but also increases the initial envelope radius of convergence, and can more effectively deal with convex edge of the case of high curvature. comparative experiments illustrate the effectiveness of this approach.
Date : 2025-12-31 Size : 153kb User : 罗朝辉
[Software Engineering] parallel--toolbox-2012 DL : 0: 并行计算工具箱软件提供循环执行性能可以允许一些matlab工程师可以同时执行单个循环迭代。例如，一个100次迭代的循环需要一群20人的matlab工程师来完成，这是有关并行计算的叙述-Parallel computing toolbox software provides a cycle properties can be allowed to perform some matlab engineers can simultaneously execute a single cycle iteration. For example, a 100 iterations of the circulation needs a group of 20 people of matlab engineer to do this, and this is the account of parallel computing
Date : 2025-12-31 Size : 2.44mb User : 追风少年
[Software Engineering] A-good-3D-translation-method DL : 0: 本电子文档详细介绍了坐标转换的线性方法，与传统的非线性方法相比，不需迭代即可进行，非常值得一看。-This electronic document details a linear coordinate transformation method, compared with the traditional nonlinear method without iteration can be carried out is worth a visit.
Date : 2025-12-31 Size : 398kb User : baoxiuwu
[Software Engineering] sanjiaomatlabkaiti DL : 0: CORDIC（Coordinate Rotational Digital Computer，坐标旋转计算机）算法是Volder于1959年在美国航空控制系统的设计中提出来的，它是一种用于计算运算函数的循环迭代算法。其基本思想是用一系列与运算基数相关的角度的不断偏摆，从而逼近所需旋转的角度。-On CORDIC (Coordinate Rotational Digital the Computer, coordinate rotation computer) algorithm by Volder in 1959 in the U.S. air traffic control system design, it is the loop iteration algorithm for computing the arithmetic function. The basic idea is the constant deflection angle series and computing base, thus approaching the angle of rotation required.
Date : 2025-12-31 Size : 14kb User : wangl
[Software Engineering] RS-fountain-code- DL : 0: 一种迭代方法的RS喷泉码的编译码算法，喷泉码的初学者有很大的帮助，尤其是实现编译过程-A iteration method of RS fountain code of knitting decoding algorithm, fountain code beginners are of great help, especially realize compilation process
Date : 2025-12-31 Size : 375kb User : zhouxiaolin
[Software Engineering] An-expanding-SOM DL : 0: 自组织映射（SOM）已成功处理的欧式旅行的鹅岭推销员问题（TSP）。通过将其邻域保持财产和凸包属性数值模拟TSP，我们引入了一个新的SOM如神经网络，称为前panding的SOM（ESOM）的。在每一个学习的迭代，ESOM提请接近的兴奋神经元输入的城市，并在此期间，推压它们向凸包ofcities合作。 ESOM可能收购邻里保护财产和凸包的属性的TSP，因此它可以产生接近最优的解决方案。从理论上分析了其可行性和经验。一个的系列ofexperiments进行合成和基准的TSP，其大小范围从50到2400个城市。实验结果表明的优越性通过几个典型的SOM SOM开发由Budinich，凸的ESOM 弹力网，和的克尼斯算法。虽然其解的精度是尚未与其他一些复杂的的启发式，ESOM是之一最精确的神经网络的TSP在文献中。-The self-organizing map (SOM) has been successfully employed to handle the Euclidean trav-eling salesman problem (TSP). By incorporating its neighborhood preserving property and the convex-hull property ofthe TSP, we introduce a new SOM-like neural network, called the ex-panding SOM (ESOM). In each learning iteration, the ESOM draws the excited neurons close to the input city, and in the meantime pushes them towards the convex-hull ofcities cooperatively. The ESOM may acquire the neighborhood preserving property and the convex-hull property of the TSP, and hence it can yield near-optimal solutions. Its feasibility is analyzed theoretically and empirically. A series ofexperiments are conducted on both synthetic and benchmark TSPs, whose sizes range from 50 to 2400 cities. Experimental results demonstrate the superiority of the ESOM over several typical SOMs such as the SOM developed by Budinich, the convex elastic net, and the KNIES algorithms. Though its solution accuracy is no
Date : 2025-12-31 Size : 337kb User :
[Software Engineering] Flow-Calculation-Based-on-Matlab DL : 0: 一篇基于Matlab的Gauss_Seidel迭代法电力系统潮流计算的文献-Gauss-Seidel Iteration Method in Flow Calculation Based on Matlab
Date : 2025-12-31 Size : 174kb User : 赵磊
[Software Engineering] PR_Nguyen DL : 0: This routine returns the coefficients of the 𝑁 -coefficient symmetric prototype filter 𝐻 (𝑧 ). The coefficients are normalized to have energy 1/2. When the analysis and synthesis filters are configured as shown above, the overall system has an impulse response with a unity coefficient at a delay of 𝑁 − 1 samples. The procedure described in the paper above was modified to employ a cautious update during the iteration process – without this modification, the procedure did not converge. Example A sample use of QMFDesign is shown below.
Date : 2025-12-31 Size : 3kb User : ENZO
[Software Engineering] 201305236-7 DL : 0: mathlab题目代码，编程分别用jocabi迭代法求解方程。在一般情况下，Guass-Seide迭代法比Jacobi迭代法收敛要快一些，但这也不是绝对的，在木些情况下，Jacobi迭代法收敛，Guass-Seide迭代却可能不收敛-use matlab to deal with the equation -mathlab subject code, programming respectively jocabi iterative method for solving equations. Under normal circumstances, Guass-Seide iteration convergence than the Jacobi iterative method to be faster, but it is not absolute, and in some cases wood, Jacobi iteration converges, Guass-Seide iteration but may not converge-use matlab to deal with the equation
Date : 2025-12-31 Size : 8kb User : wangwenjin
[Software Engineering] pthread_ms_static DL : 0: this implemented by pthread(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by rows to any other threads to complete the total jobs.-this is implemented by pthread(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by rows to any other threads to complete the total jobs.
Date : 2025-12-31 Size : 2kb User : 梁庭量
[Software Engineering] pthread_ms_dynamic DL : 0: this implemented by pthread(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by dynamic mode (different from static)by rows to any other threads to complete the total jobs.-this is implemented by pthread(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by dynamic mode (different from static)by rows to any other threads to complete the total jobs.
Date : 2025-12-31 Size : 2kb User : 梁庭量
[Software Engineering] openmp_ms_static DL : 0: this implemented by OpenMP(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by(static rule) rows to any other threads to complete the total jobs.-this is implemented by OpenMP(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by(static rule) rows to any other threads to complete the total jobs.
Date : 2025-12-31 Size : 1kb User : 梁庭量
[Software Engineering] openmp_ms_dynamic DL : 0: this implemented by OpenMP(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by(dynamic rule) rows to any other threads to complete the total jobs.-this is implemented by OpenMP(share library) to draw the mandelbrot set.Using the iteration to try to compute the x and y value.and divide work by(dynamic rule) rows to any other threads to complete the total jobs.
Date : 2025-12-31 Size : 1kb User : 梁庭量
[Software Engineering] k DL : 0: 中括号内的序号为寻找聚类中心的迭代运算的次序号。聚类中心的向量值可任意设定，例如可选开始的K个模式样本的向量值作为初始聚类中心。-The number in brackets in order to find the cluster centers iteration sequence number. Cluster center value can be set to, for example, the beginning of an optional mode of samples to the K value as the initial cluster centers.
Date : 2025-12-31 Size : 1kb User : guiyun
[Software Engineering] sgrasp DL : 0: This paper is a survey of greedy randomized adaptive search procedures (GRASP). GRASP is a multi-start or iterative procedure where each GRASP iteration con- sists of a construction phase, where a feasible solution is constructed, followed by a local search procedure that finds a locally optimal solution. The construction phase of GRASP is essentially a randomized greedy algorithm. Repeated applications of the construction procedure yields diverse starting solutions for the local search. We review a basic GRASP, followed by enhancements to the basic procedure. We conclude by surveying operations research and industrial applications of GRASP.
Date : 2025-12-31 Size : 104kb User : Nydiron

« 12 »