A New Evolutionary Algorithm for Spanning-Tree Based Communication Network Design(Network)

スポンサーリンク

概要

• 論文の詳細を見る

• A novel evolutionary algorithm is described for designing the topology of spanning tree-based communication networks. Two specific performance objectives are dealt with : the optimum communication spanning tree problem (OCSTP), and the quadratic minimum spanning tree problem (q-MST). Improved network performance is reliably obtained when using the proposed algorithm on accepted benchmark instances, in comparison with the previous best-known approaches. The same methodology can be applied straightforwardly to the design of communication networks with other objectives.

• 社団法人電子情報通信学会の論文
• 2005-10-01

著者

• Soak Sang‐moon

  Korean Intellectual Property Office (kipo) Dae‐jeon Kor

• AHN Byung-Ha

  Department of Mechatronics, K-JIST

• Ahn Byung-ha

  Department Of Mechatronics Gist

• SOAK Sang-Moon

  Department of Mechatronics, GIST

• CORNE David

  Department of Computer Science, University of Exeter

• Corne David

  Department Of Computer Science University Of Exeter

• Ahn Byung‐ha

  Gist Gwangju Kor

関連論文

• Real-Time Re-transmission from ATSC to OpenCable(Papers Selected from 2003 International Technical Conference on Circuits/Systems, Computers and Communications(ITC-CSCC 2003))
• Analysis on the Parameters of the Evolving Artificial Agents in Sequential Bargaining Game(Software Agent and Its Applications)
• A New Evolutionary Algorithm for Spanning-Tree Based Communication Network Design(Network)

スポンサーリンク