⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 11.htm

📁 遗传算法的详细描述文档,文档中附带一定的代码解释
💻 HTM
字号:
<html>
<head>
<meta http-equiv="Content-Type" content="text/html; charset=gb2312">
<title>CTerm非常精华下载</title>
</head>
<body bgcolor="#FFFFFF">
<table border="0" width="100%" cellspacing="0" cellpadding="0" height="577">
<tr><td width="32%" rowspan="3" height="123"><img src="DDl_back.jpg" width="300" height="129" alt="DDl_back.jpg"></td><td width="30%" background="DDl_back2.jpg" height="35"><p align="center"><a href="http://202.112.20.132"><font face="黑体"><big><big>白云黄鹤★</big></big></font></a></td></tr>
<tr>
<td width="68%" background="DDl_back2.jpg" height="44"><big><big><font face="黑体"><p align="center">                     遗传算法                                                   </font></big></big></td></tr>
<tr>
<td width="68%" height="44" bgcolor="#000000"><font face="黑体"><big><big><p   align="center"></big></big><a href="http://cterm.163.net"><img src="banner.gif" width="400" height="60" alt="banner.gif"border="0"></a></font></td>
</tr>
<tr><td width="100%" colspan="2" height="100" align="center" valign="top"><br><p align="center">[<a href="index.htm">回到开始</a>][<a href="index.htm">上一层</a>][<a href="12.htm">下一篇</a>]
<hr><p align="left"><small>发信人: coy (我爱美好哦), 信区: Algorithm <br>

标  题: 遗传算法(11) <br>

发信站: 武汉白云黄鹤站 (Wed May 31 21:48:15 2000), 站内信件 <br>

  <br>

//multiply.c <br>

  <br>

#include "f:\coy\mywork\lunwen\gaopc\thesis.h" <br>

void mmprod(m,nm,n,mul_cm,mul_am,mul_bm) <br>

int m, <br>

    nm, <br>

    n; <br>

MATRIX mul_cm, <br>

       mul_am, <br>

       mul_bm; <br>

{ <br>

 int i,j,k; <br>

 for(i= 1; i<=m; i++) <br>

  for(j = 1; j<=n; j++) <br>

   { <br>

     mul_cm[i][j] = 0.0; <br>

     for (k= 1;k<nm+1;k++) <br>

       mul_cm[i][j] = mul_am[i][k]*mul_bm[k][j]  + mul_cm[i][j]; <br>

    } <br>

    } <br>

} <br>

void mvprod(m,nm,cm,am,bm) <br>

int m, <br>

    nm; <br>

VECTOR cm, <br>

       bm; <br>

MATRIX am; <br>

{ <br>

int i,k; <br>

 for (i = 1; i<=m; i++) <br>

  { <br>

   cm[i]=0.0; <br>

   for (k = 1; k<=nm; k++) <br>

    cm[i] = cm[i] + am[i][k]*bm[k]; <br>

  } <br>

} <br>

  <br>

-- <br>

                              ○ <br>

                             <\\> <br>

                               )) <br>

  <br>

    nm; <br>

VECTOR cm, <br>

       bm; <br>

MATRIX am; <br>

{ <br>

int i,k; <br>

 for (i = 1; i<=m; i++) <br>

  { <br>

   cm[i]=0.0; <br>

   for (k = 1; k<=nm; k++) <br>

    cm[i] = cm[i] + am[i][k]*bm[k]; <br>

  } <br>

} <br>

  <br>

-- <br>

                              ○ <br>

                            \○/ <br>

                              ┃ <br>

                             /\ <br>

                    脖子扭扭,屁股扭扭,大家一起来跳舞 <br>

  <br>

※ 来源:.武汉白云黄鹤站 bbs.whnet.edu.cn.[FROM: 211.69.196.11] <br>

[阅读精华区资料]  结束Q, ← │ 上一项资料 U,↑│ 下一项资料 <Enter>,<Space>,↓ <br>

</small><hr>
<p align="center">[<a href="index.htm">回到开始</a>][<a href="index.htm">上一层</a>][<a href="12.htm">下一篇</a>]
<p align="center"><a href="http://cterm.163.net">欢迎访问Cterm主页</a></p>
</table>
</body>
</html>

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -