Analysis of Completeness of Laboratory Assignment Algorithm by Rewrite Systems Theory

3 References

Bibliographic Information

Other Title
  • 書換え系理論を用いた講座配属アルゴリズムの完備性の解析

Search this article

Description

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 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.

Journal

  • IPSJ SIG Notes

    IPSJ SIG Notes 44 21-28, 1995-03-17

    Information Processing Society of Japan (IPSJ)

References(3)*help

See more

Details 詳細情報について

  • CRID
    1573950401930666880
  • NII Article ID
    110002812284
  • NII Book ID
    AN1009593X
  • ISSN
    09196072
  • Text Lang
    ja
  • Data Source
    • CiNii Articles

Report a problem

Back to top