Complete graphs and orderings

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Ranking of help functions with respect to their usefulness is in the main focus of this work. In this work a help function is regarded as useful to a student if the student has succeeded to solve a problem after using it. Methods from the theory of partial orderings are further applied facilitating an automated process of suggesting individualised advises on how to proceed in order to solve a particular problem. The decision making process is based on the common assumption that if given a choice between two alternatives, a person will choose one. Thus obtained partial orderings appeared to be all linear orders since each pair of alternatives is compared. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Encheva, S. (2011). Complete graphs and orderings. In Communications in Computer and Information Science (Vol. 188 CCIS, pp. 309–319). https://doi.org/10.1007/978-3-642-22389-1_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free