%0 Journal Article
%T Learning-Task Scheduling Algorithm Based on CSP Model<br>基于CSP的学习智能导航服务模型与算法研究
%A CHEN Yi-xiong
%A WU Zhong-fu
%A FEND Yong
%A ZHU Zheng-zhou
%A <br>陈乙雄
%A 吴中福
%A 冯永
%A 朱郑州
%J 计算机科学
%D 2010
%I 
%X This paper focused on realizing intelligent guide service for learning activities in clearning environment. At present, our research group has adopted a knowledge topi}based content routing algorithm and resource combination algorithm to meet the individualize rectuirements from learners. However, the learning effect still lacks of assurance although the expected content package was generated. In fact, the learning process is consisted of a series of learning tasks in stead of static contents,so the effect of learning can only be guaranteed by a group of well organized learning tasks which arc designed according to educational methodology. I}hus,this paper established a learning task layer above the former knowledge topic layer and converted the scheduling problem as a Constrain Satisfaction Problem, and proposed the solution. The experiments showed that the proposed algorithm can generate an optimized schedule which is effective in providing learning guide service.
%K Scheduling
%K E-learning
%K CSP
%K AI planning<br>调度，远程教育，约束满足问题，智能导航
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=64A12D73428C8B8DBFB978D04DFEB3C1&aid=42F17AAEACFD988DC66FDA2969A985A0&yid=140ECF96957D60B2&vid=42425781F0B1C26E&iid=59906B3B2830C2C5&sid=2001E0D53B7B80EC&eid=D997634CFE9B6321&journal_id=1002-137X&journal_name=计算机科学&referenced_num=0&reference_num=0