Algorithms for automatic ranking of participants and tasks in an anonymized contest (Q2272379): Difference between revisions

From MaRDI portal
Changed label, description and/or aliases in en, and other parts
Merged Item from Q2980920
 
aliases / en / 0aliases / en / 0
 
Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest
description / endescription / en
 
scientific article; zbMATH DE number 6711898
Property / title
 
Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest (English)
Property / title: Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1430.68123 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-319-53925-6_26 / rank
 
Normal rank
Property / published in
 
Property / published in: WALCOM: Algorithms and Computation / rank
 
Normal rank
Property / publication date
 
5 May 2017
Timestamp+2017-05-05T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 5 May 2017 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6711898 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2584192475 / rank
 
Normal rank

Latest revision as of 09:51, 6 May 2024

scientific article; zbMATH DE number 6711898
  • Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest
Language Label Description Also known as
English
Algorithms for automatic ranking of participants and tasks in an anonymized contest
scientific article; zbMATH DE number 6711898
  • Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest

Statements

Algorithms for automatic ranking of participants and tasks in an anonymized contest (English)
0 references
Algorithms for Automatic Ranking of Participants and Tasks in an Anonymized Contest (English)
0 references
0 references
0 references
0 references
0 references
0 references
10 September 2019
0 references
5 May 2017
0 references
0 references
0 references
chain editing
0 references
chain addition
0 references
truth discovery
0 references
massively open online classes
0 references
student evaluation
0 references
0 references
0 references
0 references