论文信息 - T-Coloring Algorithm Based on Multiagent Evolution: T-Coloring Algorithm Based on Multiagent Evolution - 字舞流文

T-Coloring Algorithm Based on Multiagent Evolution: T-Coloring Algorithm Based on Multiagent Evolution

Jing Liu | Kang Hu | Li-Cheng Jiao | Jin-Shu Li | Jing-Run Wang

[1] Chi-Hyuck Jun,et al. Frequency Insertion Strategy for Channel Assignment Problem , 2006, Wirel. Networks.

[2] Jing Liu,et al. A multiagent evolutionary algorithm for constraint satisfaction problems , 2006, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[3] W. K. Hale. Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[4] S. U. Thiel,et al. FASoft: A system for discrete channel frequency assignment , 1997 .

[5] Chi Wan Sung,et al. Sequential packing algorithm for channel assignment under cochannel and adjacent-channel interference constraint , 1997 .

[6] L. G. Anderson. A Simulation Study of Some Dynamic Channel Assignment Algorithms in a High Capacity Mobile Telecommunications System , 1973, IEEE Trans. Commun..

[7] Jeannette Janssen,et al. An optimal solution to the "Philadelphia" channel assignment problem , 1999 .

[8] Carlo Mannino,et al. Minimizing the span of d-walks to compute optimum frequency assignments , 2002, Math. Program..

[9] Jing Liu,et al. A multiagent genetic algorithm for global numerical optimization , 2004, IEEE Trans. Syst. Man Cybern. Part B.

[10] Daniel Costa,et al. On the use of some known methods forT-colorings of graphs , 1993, Ann. Oper. Res..