模擬螞蟻 的英文怎麼說

中文拼音 []
模擬螞蟻 英文
sim ant
  • : 模名詞1. (模子) mould; pattern; matrix 2. (姓氏) a surname
  • : 動詞1. (設計; 起草) draw up; draft 2. (打算; 想要) intend; plan 3. (模仿) imitate
  • : 螞構詞成分。
  • : 名詞1. (昆蟲的一科) ant 2. (姓氏) a surname:蟻強 yi qiang
  • 模擬 : imitate; simulate; analog; analogy; imitation; simulation模擬艙 boilerplate; 模擬電路 [電學] circ...
  • 螞蟻 : ant
  1. Study of the combination of ant algorithm and quasi - newton algorithm in computing mathematical model of water supply network

    演算法與牛頓法嫁接求解管網數學
  2. The results show the improved aca can be used to solve the continued problem, and the formula whose parameter is optimized by the improved aca can simulate the primary data better than those whose parameter are optimized by other optimizing methods except the immune evolutionary algorithm ( iea ), and the improved aca can get almost the same result with less optimization scale and shorter optimization time than iea

    結果表明,改進的演算法可以成功用於暴雨強度公式的參數優化,並且在實驗採用的各種優化演算法優化參數得到的暴雨強度公式合原始數據的效果比較中只有免疫進化演算法在優化過程中迭代次數和迭代規都要大得多的情況下才和改進的演算法差不多,而比其它的優化方法都要好。
  3. Have set up the emulation model of computer that the regional economy simplified was formed and developed from the quantitative angle, utilize the emulation algorithm of the computer : cluster analysis, the hereditary algorithm and ant ' s algorithm, differentiate forming stage, growth stage ( forms growth pole ) and ripe stage of the regional economy of simulation ( axles set out exhibition mode gradually )

    不同經濟實體通過繼承、協作和發展自身慣例形成競爭局面,最終形成區域經濟發展的增長極。最後,利用演算法區域經濟成熟階段。在增長極的基礎上形成發展軸,以點帶軸,以軸帶面,最終形成網狀結構。
  4. As an example, the parallel machine scheduling problem is mapped on a non - constrained matrix construction graph, and a aco algorithm is proposed to solve the parallel machine scheduling problem. comparison with other best - performing algorithm, the algorithm we proposed is very effective. the finite deterministic markov decision process corresponding to the solution construction procedure of aco algorithm is illustrated in the terminology of reinforcement learning ( rl ) theory

    本章最後提出了解決并行機調度問題的群演算法,該演算法把并行機調度問題映射為無約束矩陣解構造圖,並在演算法的信息素更新過程中應用了無約束矩陣解構造圖的局部歸一化種子信息素更新規則,與其他幾個高性能演算法的對比試驗證明這種方法是非常有效的。
  5. In order to help algorithm jump out of local max, simulating ant searching food strategy has been brought forward. it is designed based on ant ' s searching food behavior. its core is when algorithm enters into local max, put individuals to cross with idle individuals and replace those by spared individuals which do n ' t have cross with idle individuals

    為使演算法在陷入局部極優后能自動跳出,提出了模擬螞蟻覓食的執行策略,這種策略是模擬螞蟻覓食中不斷調整不斷轉移目標而啟發設計的,要點是在演算法進入局部極優后不再執行原有的交叉操作,而是與游蕩個體相交叉,未得到交叉的個體則以後備個體相替換。
  6. Base on the existing synchronous sequential circuits fault simulator - hope, the test vector generation method of sequential circuits based on ant algorithm is systematically researched firstly

    本文在同步時序電路故障器? hope的基礎上,率先對基於演算法的時序電路測試矢量生成方法作了系統的開拓性研究。
  7. They run races ; they wrestle ; and sometimes they have mock fights together

    參加各種賽跑,摔跤,有時還在一起戰斗。
  8. A kind of heuristic information based on the dannenbring approach is introduced in the procedure of solution construction. the experiment shows that the stagnation step out mechanism and the pheromone trail limit mechanism can help ants stepping out of stagnation and the heuristic information is very effective, in addition, the eligibility trace mechanism in ant - q ( ) algorithm can greatly improve the performance of algorithm based on solution construction graph in arc mode

    試驗表明,信息素的結點式總體優于孤式;啟發式信息能較大改進演算法性能; acostag演算法的信息素蹤跡更新過程中的停滯狀態脫離機制以及信息素蹤跡限制機制能幫助跳出局部最優解;此外antqo )演算法的資格跡機制能大大改進採用弧式解構造圖的群演算法性能。
分享友人