摘要
本文分析了计算机自动组卷算法的约束满足特性,并结合一个实际的题库管理系统的设计与实现,从策略上讨论了如何解决自动组卷算法中约束满足问题。
This paper analyzes the behaviours of the CSP (Constraints satisfaction problem)for computer to generate the test - sheets automatically. Combining with the design andcompletion of a system of test-problems-base of″the principle of digital computer organization″,the strategies of solving, the CS for computer generating the test-sheet automatically are presented.
出处
《小型微型计算机系统》
CSCD
北大核心
1995年第9期51-55,共5页
Journal of Chinese Computer Systems
基金
国家教委资助
关键词
CAI
自动组卷
计算机
算法
Constraints satisfaction problem, Management system for test problems,CAI