The Simulated Annealing Group Assignment ( SAGA ) Application
暂无分享,去创建一个
The task of assigning students to Critical Inquiry Course (CIC) sections, taking into account the preferences and demographics of the students and the sizes of the sections, is a formidable task by hand and is not trivial to automate. The Simulated Annealing Group Assignment (SAGA) application employs simulated annealing, a stochastic approximation algorithm, to search for an optimal CIC section assignment within a reasonable amount of time. SAGA may be applied not only to the problem of assigning students to CIC sections, but also to a much more general range of group assignment problems.
[1] C. McDiarmid. SIMULATED ANNEALING AND BOLTZMANN MACHINES A Stochastic Approach to Combinatorial Optimization and Neural Computing , 1991 .
[2] Stephen I. Gallant,et al. Neural network learning and expert systems , 1993 .
[3] Peter Norvig,et al. Artificial Intelligence: A Modern Approach , 1995 .
[4] Stan Z. Li,et al. Markov Random Field Modeling in Computer Vision , 1995, Computer Science Workbench.
[5] K. Nara. Simulated Annealing Applications , 1999 .