Learn More
 Founding information: This work is partially sponsored by the Natural Science Foundation of Zhejiang Province, China (M603245, Y106469), and National high tech research and development plan (863plan):2007AA01Z105-05 Abstract—Using software agents as next generation flexible components and applying reuse technologies to rapidly construct agents and agent(More)
The techniques of path finding and its optimization are widely applied in the fields of game development, intelligent navigation, GIS and so on. We have pointed out the deficiency of A * algorithm by analyzing the algorithm based on heuristic search and combining with the field of game development. By the skill of flood filling and the potential field to(More)
Nowadays, intelligent teaching system can’t realize the function of individuation serve well. This paper introduces the technique of agent into intelligent teaching system, constructs an architecture of individuation Web-learning based on multi-agent, analyses the functions and working process of every agent in the architecture, and proposes a model(More)
With the development of Internet, distance education platforms are very popular in today's society, but there are quite a few problems existent, such as the inadequate utilization of network teaching resources and the lack of individuation of the existed distance education platforms. To solve these problems have become the key of designing a good distance(More)
The Compiler Construction Principles course is a core foundation stone in a computer science curriculum. The course features a combination of strong theoretical and practical. In order to help students understand the integral structure of compiler and master the complex principles and methods of compiler more easily, an assisted instruction software for(More)
Based on the Nearest Neighbor Algorithm, this paper introduces the Algorithm of Gradually Convergent and the Cross-wire Cutting, which according to gradually convergence of the path-changing and the principle of minimum path length variation respectively. Both of them optimize the algorithm of Optimal Hamilton Circuit in undirected complete graphs,(More)
  • 1