Two Ant Colony Algorithms for Best-Effort Routing in Datagram Networks
暂无分享,去创建一个
[1] Marco Dorigo,et al. Optimization, Learning and Natural Algorithms , 1992 .
[2] Michael L. Littman,et al. Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach , 1993, NIPS.
[3] Marco Dorigo,et al. AntNet: Distributed Stigmergetic Control for Communications Networks , 1998, J. Artif. Intell. Res..
[4] Cengiz Alaettinoglu,et al. Performance comparison of routing protocols under dynamic and static file transfer connections , 1992, CCRV.
[5] Dimitri P. Bertsekas,et al. Data Networks , 1986 .
[6] Dit-Yan Yeung,et al. Predictive Q-Routing: A Memory-based Reinforcement Learning Approach to Adaptive Traffic Control , 1995, NIPS.
[7] J. Davenport. Editor , 1960 .
[8] J. Moy,et al. OSPF: Anatomy of an Internet Routing Protocol , 1998 .
[9] Marco Dorigo,et al. Ant system: optimization by a colony of cooperating agents , 1996, IEEE Trans. Syst. Man Cybern. Part B.
[10] Eric C. Rosen,et al. The New Routing Algorithm for the ARPANET , 1980, IEEE Trans. Commun..
[11] Alain Hertz,et al. Ants can colour graphs , 1997 .
[12] Marco Dorigo,et al. From Natural to Artificial Swarm Intelligence , 1999 .
[13] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..
[14] M. Dorigo,et al. 1 Positive Feedback as a Search Strategy , 1991 .
[15] M. Steenstrup. Routing in communications networks , 1995 .
[16] Manuela M. Veloso,et al. Multiagent Systems: A Survey from a Machine Learning Perspective , 2000, Auton. Robots.