Title :
Analysis of completeness of laboratory assignment algorithm by abstract reduction systems theory
Author :
Noto, Masato ; Kurihara, Masahito ; Ohuchi, Azuma
Author_Institution :
Fac. of Eng., Hokkaido Univ., Sapporo, Japan
Abstract :
A laboratory assignment algorithm is a procedure that assigns each of the m students to one of the n laboratories. In this paper, we prove the completeness (i.e., termination and confluence) of the algorithm by using the abstract reduction systems theory. Termination guarantees that the computation will not proceed indefinitely, and confluence guarantees that the computational result is unique even in the presence of indeterminacy
Keywords :
algorithm theory; computational complexity; education; operations research; abstract reduction systems theory; completeness analysis; education; indeterminacy; laboratory assignment algorithm; termination; Algorithm design and analysis; Laboratories; Tin;
Conference_Titel :
SICE '95. Proceedings of the 34th SICE Annual Conference. International Session Papers
Conference_Location :
Hokkaido
Print_ISBN :
0-7803-2781-0
DOI :
10.1109/SICE.1995.526651
