Optimized scheduling: Difference between revisions
Jump to navigation
Jump to search
PhilPavlik (talk | contribs) No edit summary |
No edit summary |
||
| Line 2: | Line 2: | ||
[[Category:Refinement and Fluency]] | [[Category:Refinement and Fluency]] | ||
Applying an instructional schedule that has been ordered to maximize robust learning | Applying an [[instructional schedule]] that has been ordered to maximize [[robust learning]]. Mathematical models may often be used to produce optimized schedules by computing the knowledge component that will be most efficiently learned if practiced next. | ||
Examples of optimized scheduling include [[learning event scheduling]] (see [[Optimizing the practice schedule|Pavlik's study]]), the [[knowledge tracing]] algorithm used in [[Cognitive Tutors]] (see [[Cen's study]]), and adaptive [[fading]] of [[scaffolding]] or [[assistance]] (see [[Does learning from worked-out examples improve tutored problem solving? |Renkl's study]]). | |||
Revision as of 21:50, 19 April 2007
Applying an instructional schedule that has been ordered to maximize robust learning. Mathematical models may often be used to produce optimized schedules by computing the knowledge component that will be most efficiently learned if practiced next.
Examples of optimized scheduling include learning event scheduling (see Pavlik's study), the knowledge tracing algorithm used in Cognitive Tutors (see Cen's study), and adaptive fading of scaffolding or assistance (see Renkl's study).