DocumentCode :
2043027
Title :
Research on Coloring Theory and Greedy Method Based Automated Examination Arrangement Algorithm
Author :
Yong Ouyang ; Han Li
Author_Institution :
Sch. of Comput. Sci., Hubei Univ. of Technol., Wuhan
fYear :
2009
fDate :
23-24 May 2009
Firstpage :
1
Lastpage :
4
Abstract :
Aiming at existing examination arrangement algorithm lacks of application value due to its too ideal conditions, this paper presents a improved algorithm based on coloring theory and greedy method, which realize automated examination arrangement by allocating resources such as examination time and classrooms by stages. The algorithm can solve kinds of forced/feasible constraints and satisfies users.
Keywords :
educational administrative data processing; graph colouring; greedy algorithms; automated examination arrangement; coloring theory; greedy method; Algorithm design and analysis; Application software; Computer science; Genetics; Polynomials; Resource management; Simulated annealing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Intelligent Systems and Applications, 2009. ISA 2009. International Workshop on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-3893-8
Electronic_ISBN :
978-1-4244-3894-5
Type :
conf
DOI :
10.1109/IWISA.2009.5073063
Filename :
5073063
Link To Document :
بازگشت