DocumentCode
3493263
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
fYear
1995
fDate
26-28 Jul 1995
Firstpage
1171
Lastpage
1176
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;
fLanguage
English
Publisher
ieee
Conference_Titel
SICE '95. Proceedings of the 34th SICE Annual Conference. International Session Papers
Conference_Location
Hokkaido
Print_ISBN
0-7803-2781-0
Type
conf
DOI
10.1109/SICE.1995.526651
Filename
526651
Link To Document