网站首页

登录

NSGA2-MOPSO

于 2018-04-20 发布文件大小:1394KB

 0  182

下载积分: 1 下载次数: 15

我要下载

代码说明：

NSGA2 and MOPSO algorithms

文件列表：

kodlar_koray\13898369MOEAs (1).rar, 37272 , 2018-04-20
kodlar_koray\2499795a3efcb8e9dbefdda2164123af.rar, 2932 , 2018-04-20
kodlar_koray\3202a8cd6f99e518dbf9b1e9abd8859b.rar, 482349 , 2018-04-20
kodlar_koray\33753144MOPSO.zip, 12256 , 2018-04-20
kodlar_koray\3970997NSGA-II-Codes.rar, 5471 , 2018-04-20
kodlar_koray\3971011nsga2-gnuplot-v1.1.rar, 24334 , 2018-04-20
kodlar_koray\4340737MOEA-NSGA-II.rar, 370705 , 2018-04-20
kodlar_koray\69491725Improved-NSGA-II-Optimization (1).zip, 10814 , 2018-04-20
kodlar_koray\8895885MOEA (1).rar, 458359 , 2018-04-20
kodlar_koray\93ccd47a762fc961ea16b3d76e4c9cf5 (1).zip, 9911 , 2018-04-20
kodlar_koray\c3dc49c66f05c547f322725fb134c17c.zip, 11639 , 2018-04-20
kodlar_koray\c51b897061c3de5d98ce6b98bb81d363.zip, 3405 , 2018-04-20
kodlar_koray\def922516e065dbeb18a785c2595d034.rar, 12905 , 2018-04-20
kodlar_koray, 0 , 2018-04-20

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

SVD
用matlab仿真，通过不同的方法计算矩阵的SVD分解，并用SVD的方法计算最小二乘问题和进行图像压缩(Matlab simulation, different ways to calculate the matrix SVD decomposition and the SVD method to calculate the least squares problem and the image compression)

2012-08-16 12:53:55下载

积分：1
NONSAP
说明：非线性有限元程序，NONSAP is a general finite element program for the nonlinear static and dynamic analysis of complex structures. The program is very flexible and was designed to be extended and modified by the user. In particular the program can easily be modified to use a different formulation of the equations of motions, different time integration operators and other additional options. (Nonlinear finite element program, NONSAP is a general finite element program for the nonlinear static and dynamic analysis of complex structures. The program is very flexible and was designed to be extended and modified by the user. In particular the program can easily be modified to use a different formulation of the equations of motions, different time integration operators and other additional options.)

2020-10-08 21:27:36下载

积分：1
ellf
说明：巴特沃斯、切比雪夫I和椭圆滤波器设计的源程序！非常难得！简洁的C语言编写(Butterworth, Chebyshev I and elliptic filter design of the source! Very rare! Concise C language)

2005-10-26 22:53:24下载

积分：1
PCG
％ SSOR预处理的共轭梯度法求解方程Ax=b ％输入参数说明％ A 正定矩阵[n*n] ％ b 右边向量％ omega SSOR预处理参数(0--2) ％ Times 迭代次数％ errtol 给定误差终止条件％％输出参数％ NewX 方程Ax=b的x近似解％ avgerr 求解的当前平均绝对误差( SSOR preconditioning conjugate gradient method for solving equations Ax = b the input parameter descriptions A positive definite matrix [n* n] b right side vector omega SSOR preconditioning parameters (0- 2) Times iterations errtol termination of a given error condition NewX output parameter equation Ax = b of x approximate solution to solve the current avgerr average absolute error)

2007-11-16 01:14:24下载

积分：1
Pointandsegment
判断点和线段之间的关系，包括点在线段的上，点在线段的延长线，反向延长线，点在线段外四种情况(Judge the relationship between the point and line, including the point on the line, in line at the extension of reverse extension cord, and so on.)

2013-01-08 14:54:18下载

积分：1
3
说明：下三角复矩阵求逆的ASIC设计及实现论文 pdf(Lower triangular complex matrix inverse of the ASIC Design and Implementation of)

2009-09-25 22:51:57下载

积分：1
11087 统计逆序对
Description 设a[0…n-1]是一个包含n个数的数组，若在i<j的情况下，有a[i]>a[j]，则称(i, j)为a数组的一个逆序对（inversion）。比如 <2,3,8,6,1> 有5个逆序对。请采用类似“合并排序算法”的分治思路以O(nlogn)的效率来实现逆序对的统计。一个n个元素序列的逆序对个数由三部分构成：（1）它的左半部分逆序对的个数，（2）加上右半部分逆序对的个数，（3）再加上左半部分元素大于右半部分元素的数量。其中前两部分（1）和（2）由递归来实现。要保证算法最后效率O(nlogn)，第三部分（3）应该如何实现？此题请勿采用O(n^2)的简单枚举算法来实现。并思考如下问题：（1）怎样的数组含有最多的逆序对？最多的又是多少个呢？（2）插入排序的运行时间和数组中逆序对的个数有关系吗？什么关系？输入格式第一行：n，表示接下来要输入n个元素，n不超过10000。第二行：n个元素序列。输出格式逆序对的个数。输入样例 5 2 3 8 6 1 输出样例 5(Set a[0... N-1] is a n array containing n numbers. If there is a [i] > a [j] i n the case of I < j, then (i, j) is a n inversion pair of a array. For example, <2,3,8,6,1> has five reverse pairs. Please use the idea of "merge sorting algorithm" to achieve the statistics of inverse pairs with O (nlogn) efficiency. The number of inverse pairs of a sequence of n elements consists of three parts: (1) The number of reverse pairs in the left half, (2) the number of reverse pairs in the right half, (3) the number of elements in the left half is greater than that in the right half. The first two parts (1) and (2) are implemented by recursion. To ensure the final efficiency of the algorithm O (nlogn), how should the third part (3) be implemented? Do not use O (n ^ 2) simple enumeration algorithm to solve this problem.)

2019-01-07 23:52:06下载

积分：1
HeatTransfer_1D
求解一维热传导方程，格式包括FTCS、BTCS、CNCS三种差分格式(solve one dimension heat transfer equation. )

2021-04-17 16:48:53下载

积分：1
SheepWolf
羊与狼的故事...主要实现狼进入若干羊圈后，寻找最后所有羊圈中剩余的狼和眼数目( the wolf and sheep)

2012-05-27 10:02:49下载

积分：1
shuzhifenxi
数值计算各算法的程序,包括:牛顿迭代法,超松驰迭代法,微分法等.对于初学数值分析这门课程的人有很大的帮助.(Numerical calculation procedure of the algorithm, including: Newton iteration, ultra-relaxation iteration method, differential method and so on. Beginner numerical analysis for this course were very helpful.)

2008-01-24 14:50:44下载

积分：1

696518资源总数
105559会员总数
1今日下载