Sciweavers

37 search results - page 4 / 8
» Hardness Prediction for the University Course Timetabling Pr...
Sort
View
EOR
2010
119views more  EOR 2010»
13 years 7 months ago
Adaptive Tabu Search for course timetabling
This paper presents an Adaptive Tabu Search algorithm (denoted by ATS) for solving a problem of curriculum-based course timetabling. The proposed algorithm follows a general frame...
Zhipeng Lü, Jin-Kao Hao
COR
2007
80views more  COR 2007»
13 years 7 months ago
A heuristic approach to simultaneous course/student timetabling
Many approaches have been taken in academic environments to address the problem of student and course timetabling. Typically, student scheduling and course scheduling have been tr...
Christopher Head, Sami Shaban
CEC
2005
IEEE
14 years 29 days ago
An empirical analysis of the grouping genetic algorithm: the timetabling case
A grouping genetic algorithm (GGA) for the university course timetabling problem is outlined. We propose six different fitness functions, all sharing the same common goal, and look...
Rhydian Lewis, Ben Paechter
ICALP
2007
Springer
14 years 1 months ago
Universal Algebra and Hardness Results for Constraint Satisfaction Problems
We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Benoit Larose, Pascal Tesson
SIGOPS
2008
141views more  SIGOPS 2008»
13 years 7 months ago
Using model checkers in an introductory course on operating systems
During the last three years, we have been experimenting with the use of the Uppaal model checker in an introductory course on operating systems for first-year Computer Science stu...
Roelof Hamberg, Frits W. Vaandrager