Sciweavers

54 search results - page 2 / 11
» How do you know they are learning
Sort
View
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 3 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
TLT
2008
93views more  TLT 2008»
13 years 4 months ago
What Do You Prefer? Using Preferences to Enhance Learning Technology
While the growing number of learning resources increases the choice for learners on how, what and when to learn, it also makes it more and more difficult to find the learning resou...
Philipp Kärger, Daniel Olmedilla, Fabian Abel...
ITS
2000
Springer
110views Multimedia» more  ITS 2000»
13 years 8 months ago
Limitations of Student Control: Do Students Know When They Need Help?
Intelligent tutoring systems often emphasize learner control: They let the students decide when and how to use the system's intelligent and unintelligent help facilities. This...
Vincent Aleven, Kenneth R. Koedinger
JAIR
2010
94views more  JAIR 2010»
13 years 3 months ago
Which Clustering Do You Want? Inducing Your Ideal Clustering with Minimal Feedback
While traditional research on text clustering has largely focused on grouping documents by topic, it is conceivable that a user may want to cluster documents along other dimension...
Sajib Dasgupta, Vincent Ng
SOFTWARE
2008
13 years 4 months ago
What Do We Know about Developer Motivation?
s of titles and abstracts) as irrelevant to our focus. We read the remaining 519 papers in full to establish our final list. The 92 papers we chose were originally published in the...
Tracy Hall, Helen Sharp, Sarah Beecham, Nathan Bad...