35 search results - page 3 / 7 » A Heuristic Incremental Modeling Approach to Course Timetabl... |
ENDM
2006
13 years 5 months ago
2006
The students of the Industrial Design department at the TU Eindhoven are allowed to design part of their curriculum by selecting courses from a huge course pool. They do this by ha...
ACISICIS
2007
IEEE
14 years 3 days ago
2007
IEEE
This paper addresses the problem of finding a feasible solution for the University Course Timetabling Problem (UCTP), i.e. a solution that satisfies all the so-called hard const...
TAMC
2010
Springer
13 years 10 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...
ATMOS
2010
13 years 4 months ago
2010
The track allocation problem, also known as train routing problem or train timetabling problem, is to find a conflict-free set of train routes of maximum value in a railway netw...
ICSE
2004
IEEE-ACM
14 years 5 months ago
2004
IEEE-ACM
FLAVERS is a finite-state verification approach that allows an analyst to incrementally add constraints to improve the precision of the model of the system being analyzed. Except ...