University Examination Timetabling Problem is the most important combinational problem to develop a conflict-free timetable to execute all of the exams in and with the limited timeslots and other resources for universities, colleges or schools. It is also an important Nondeterministic Polynomial Time (NP)-hard problem that has no deterministic…

Views information as residual or catalytic form of energy which regulates other forms of energy in natural and artificial systems. Parallel human information processing (production systems, algorithms, heuristics) and information measurement are discussed. Suggestions for future research in area of parallel information processing include a matrix…

Discussion of checklists and their variations--job aids, algorithms, heuristics, and decision tables--covers what they are, how they are generated, and some implications of checklisting for instruction, evaluation, and learning. Examples of various kinds of checklists and 11 references are provided. (MBR)

Examines the deductive approach to error diagnosis for intelligent tutoring systems. Topics covered include the principles of the deductive approach to diagnosis; domain-specific heuristics to solve the problem of generalizing error patterns; and deductive diagnosis and the hypertext-based learning environment. (Contains 26 references.) (JLB)

The advent of computers in educational and psychological measurement has lead to the need for algorithms for optimal assembly of tests from item banks. This paper reviews the literature on optimal test assembly and introduces the contributions to this report on the topic. Four different approaches to computerized test assembly are discussed:…