FULLY HEURISTIC TIMETABLING DRIVEN BY STUDENTS' FEEDBACK ON AVAILABILITY
Keywords:
heuristic timetabling, optimal schedule of lectures and exams, soft constraint, HPC environmentAbstract
The effective methods of normal vector normalization for computer graphics are analyzed. The main methods of normal vector calculation for analytical surfaces and surfaces presented in a form of polygonal data are described. References 1. Andrea Schaerf. A survey of automated timetabling, Artificial Intelligence Review, 13(2):87- 127, Kluwer Academic Publishers, 1999. 2. Tomás Müller, Roman Barták. Interactive Timetabling: Concepts, Techniques and Practical Results, PATAT 2002 - 4th international conference on the Practice And Theory of Automated Timetabling, 58-72, 2002. 3. P. A. Kostuch. Timetabling Competition - SA-based Heuristic. 2003. 4. Myricom. Myrinet Express (MX): A High-Performance, Low-Level, Message-Passing Interface for Myrinet. Myricom, Inc., 2006.
References
1. Andrea Schaerf. A survey of automated timetabling, Artificial Intelligence Review, 13(2):87- 127, Kluwer Academic Publishers, 1999.
2. Tomás Müller, Roman Barták. Interactive Timetabling: Concepts, Techniques and Practical Results, PATAT 2002 - 4th international conference on the Practice And Theory of Automated Timetabling, 58-72, 2002.
3. P. A. Kostuch. Timetabling Competition - SA-based Heuristic. 2003.
4. Myricom. Myrinet Express (MX): A High-Performance, Low-Level, Message-Passing Interface for Myrinet. Myricom, Inc., 2006.
Downloads
-
PDF
Downloads: 194