[1] J. M. Rosenberg, “E-Learning: Strategies for delivering Knowledge in the digital age,” U.S.A:McGraw-Hill, 2001.
[2] 劉仲矩(民91), 大學生對未來遠距教學相關事項看法之研究, 銘傳大學製商整合計劃研討會論文集.
[3] 曹世亮(民90), 永續學習的e-Learning架構:以學習型組織為基礎的探討.資訊與教育雜誌特刊, pp. 163-179.[4] O. Etzioni, D. S. Weld, “Intelligent Agents on the Internet: Fact, Fiction, and Forecast,” IEEE Expert, pp. 44-49, 1995.
[5] P. Maes, ”Agent that Reduce Work and Information Overload,” Communications of ACM, vol. 37, no. 7, pp. 31-40, 1994.
[6] 王淑卿、張寶儒(2000), “在主從式多代理人架構下資訊擷取最適化之研究,” 朝陽大學資訊管理學系碩士論文。[7]D. B. Lange, M. Oshima, “Seven good reasons for mobile agents,” Communication of the ACM, vol. 42, no. 3, pp. 88-89, 1999.
[8] H. Lieberman,“Integrating user interface agents with conventional applications,”Knowledge-Based Systems, vol. 11, issue: 1, pp. 15-23, September 30, 1998.
[9] T. Magedanz, K. Rothermel, and S. Krause, “Intelligent Agents: An Emerging Technology for Next Generation Telecommunication,” Proc. INFOCOM’96, San Francisco, CA, 1996.
[10] G. Weis, “Distributed reinforcement learning,” Robotics and Autonomous Systems, vol. 15, issue: 1-2, pp. 135-142, July 1995.
[11]D. Wang, G. Yu, M. Lv, B. Song, D. Shen, and G. Wang, “An ant algorithm based dynamic routing strategy for mobile agents,” Springer-Verlag Berlin Heidelberg, pp. 453-464, 2003.
[12]T. Izumi, T. Masuzawa, “Ant-based approach to mobile agent traversal,” Springer-Verlag Berlin Heidelberg, pp. 350-363, 2004.
[13]C. H. Lee, S. G. Han, “Educational contents sharing and retrieving system using mobile agent,” Proceedings of the International Conference on Computers in Education (ICCE’02), pp. 50-54, 2002.
[14]H. Nunes, S. Labidi, “Mobile Agent for information extraction in MathNet system,” IEEE Forntiers in Education Conference, vol. 2, pp. 20-25, November 2002.
[15]C. Teixeira, S. Labidi, E. Nascimento, “Modeling the cooperative learner based on it’s actions and interactions within a teaching-learning session,” IEEE Forntiers in Education Conference, vol. 2, pp. 19-23, November 2002.
[16]S. Labidi, N. Sergio, “Student modeling and semi-automatic domain ontology construction for shiecc,” IEEE Forntiers in Education Conference, pp. 14-18, October 2000.
[17]R. D. Burke, K. J. Hammond, V. Kulyukin, S. L. Lytinen, N. Tomuro, S. Schoenberg, “Question answering from frequently-asked question files: experiences with the faq finder system,” AI Magazine, vol. 18, no. 2, pp. 57-66, 1997.
[18]M. Dorigo, V. Maniezzo, A. Colorni, “The ant system: optimization by colony of coorperating agents,” IEEE Trans. System, Man, and Cybernetics - Part B, vol. 26 , no. 1, pp. 29-41, 1996.
[19]L. M. Gambardella, M. Dorigo, “Ant colony system: a cooperative learning approach to the traveling salesman problem,” IEEE Trans. System, Man, and Cybernetics - Part B, vol. 1, no. 1, pp. 53-66, 1997.
[20] M. Dorigo, G. D. Caro, L. M. Gambardella, “Ant Algorithms for Discrete Optimization,” Artificial Life, vol. 5, no. 3, pp. 137-172, 1999.
[21] V. Maniezzo, A. Colorni, “The ant system applied to the quadratic assignment problem,” IEEE Transactions on Knowledge and Data Engineering, vol. 11, no. 5, pp. 769-778, 1999.
[22]L. M. Gambardella, M. Dorigo, “Ant-Q: a reinforcement learning approach to the traveling salesman problem,” Proceedings of ML-95, Twelfth International Conference on Machine Learning, A. Prieditis and S. Russell (Eds.), Morgan Kaufmann, pp. 252-260, 1995.
[23] T. Stutzle, “MAX-MIN Ant System for Quadratic Assignment Problems,” Technical Report AIDA-97-04, Intellectics Group, Department of Computer Science, Darmstadt University of Technology, July 1997.
[24] T. Stutzle, H. H. Hoos, “The MAX-MIN Ant System and Local Search for the Traveling Salesman Problem,” Proceedings of the IEEE International Conference on Evolutionary Computation(ICEC’97), pp. 309-314, 1997.
[25] E. D. Taillard, L. M. Grmbardwlla, “Adaptive Memories for the Quadratic Assignment Problem,” Technical Report IDSIA-87-97, IDSIA, Lugano, Switzerland, 1997.