透過您的圖書館登入
IP:3.134.118.95
  • 學位論文

以並行處理為基礎之粒子群聚最佳化法及其在不確定間隔系統數位化再設計之研究

Parallel computation of particle swarm optimization and its applications on digital redesign of uncertain interval systems

指導教授 : 許陳鑑
若您是本文的作者,可授權文章由華藝線上圖書館中協助推廣。

並列摘要


This abstract would not be displayed due to no authorization.

參考文獻


[1] J. Kennedy and R. C. Eberhart, “Particle swarm optimization,” Proc. IEEE Int. Conf. Neural Netwowks, Piscataway, NJ, 1995, pp. 1942-1948.
[4] B. Li and K. Wada, “Parallelizing particle swarm optimization,” IEEE Pacific Rim Conference, pp. 288-291.
[5] A. J. Knoek van Soest and L. J. R. Richard Casius, “The merits of a parallel genetic algorithm in solving hard optimization problems,” Journal of Biomechanical Engineering, Vol. 125, No. 1, pp. 141-146, 2003.
[6] H. Fischer and K. Ritter, “An asynchronous parallel Newton method,” Mathematical Programming, Vol. 42, No. 2, pp. 363-374, 1988.
[8] E. Alba and J. M. Troya, “Analysis synchronous and asynchronous parallel distributed genetic algorithms,” Future Generation Computer Systems, Vol. 17, pp. 451-465, 2001.

延伸閱讀