The Improvements and Extensions of Automatic Ranking Algorithms
碩士 === 國立臺灣大學 === 資訊工程學研究所 === 107 === We introduce some variants of Chain Editing problem. In our version of Chain Editing, we are given a set of participants and a set of questions. If a participant answer a question correctly, we add a edge between the participant and the question. Therefore we c...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2019
|
Online Access: | http://ndltd.ncl.edu.tw/handle/bx3ds5 |