|
關(guān)注:1
2013-05-23 12:21
求翻譯:20世紀(jì)60年代,美國(guó)密執(zhí)安大學(xué)J.Holland 教授在求解組合搜索和優(yōu)化計(jì)算的問(wèn) 遺傳算法是通過(guò)模擬自然選擇和遺傳中發(fā)生的現(xiàn)象,通過(guò)隨機(jī)選擇、交叉和變異的操作,從任一初始種群出發(fā),生成一個(gè)更適應(yīng)環(huán)境的群體,使在搜索空間中的種群進(jìn)化到越來(lái)越好的區(qū)域,這樣不斷地進(jìn)化繁衍,最后收斂到一個(gè)對(duì)環(huán)境最適應(yīng)的群體,從而得到問(wèn)題的最優(yōu)解 [4,5]。是什么意思?![]() ![]() 20世紀(jì)60年代,美國(guó)密執(zhí)安大學(xué)J.Holland 教授在求解組合搜索和優(yōu)化計(jì)算的問(wèn) 遺傳算法是通過(guò)模擬自然選擇和遺傳中發(fā)生的現(xiàn)象,通過(guò)隨機(jī)選擇、交叉和變異的操作,從任一初始種群出發(fā),生成一個(gè)更適應(yīng)環(huán)境的群體,使在搜索空間中的種群進(jìn)化到越來(lái)越好的區(qū)域,這樣不斷地進(jìn)化繁衍,最后收斂到一個(gè)對(duì)環(huán)境最適應(yīng)的群體,從而得到問(wèn)題的最優(yōu)解 [4,5]。
問(wèn)題補(bǔ)充: |
|
2013-05-23 12:21:38
In the 1960s, Professor, University of Michigan j.holland ask genetic algorithm to solve combinatorial search and optimization by simulation of natural selection and genetic occurred phenomenon, by random selection, crossover and mutation operations, from any initial population to generate a more ad
|
|
2013-05-23 12:23:18
The 1960s, the United States the University of Michigan professor Holland J . in the combined search and optimize computing of the Q * genetic algorithm is simulated through natural selection and genetic phenomena that occur in the random selection, and through, a cross-over and mutation of the oper
|
|
2013-05-23 12:24:58
The 20th century 60's, American Michigan University Professor J.Holland searches and optimizes the computation in the solution combination asking The genetic algorithm is a phenomenon which occurs
|
|
2013-05-23 12:26:38
In the 1960 of the 20th century, United States Michigan University J.Holland Professor in solution combination search and optimization calculation of asked genetic algorithm is by simulation natural select and genetic in the occurs of phenomenon, by random select, and cross and variation of operatio
|
|
2013-05-23 12:28:18
|
湖北省互聯(lián)網(wǎng)違法和不良信息舉報(bào)平臺(tái) | 網(wǎng)上有害信息舉報(bào)專區(qū) | 電信詐騙舉報(bào)專區(qū) | 涉歷史虛無(wú)主義有害信息舉報(bào)專區(qū) | 涉企侵權(quán)舉報(bào)專區(qū)