Projection, Decomposition, and Adaption of Learning Spaces

David Eppstein
Additional contact information
David Eppstein: University of California, Dept. of Computer Science

Chapter 14 in Knowledge Spaces, 2013, pp 305-322 from Springer

Abstract: Abstract In Chapter 13 we described learning sequences, a powerful tool for the computer representation of learning spaces, and we showed how to use learning sequences as the basis for computer algorithms that efficiently perform the state generation necessary for knowledge assessment in a learning space.

Keywords: Partial Order; Learning Sequence; Maximum Match; Hasse Diagram; Learning Space (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-35329-1_14

Ordering information: This item can be ordered from
http://www.springer.com/9783642353291

DOI: 10.1007/978-3-642-35329-1_14

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().