Abstract

In the e-learning systems, a learning path is known as a sequence of learning materials linked to each others to help learners achieving their learning goals. As it is impossible to have the same learning path that suits different learners, the Curriculum Sequencing problem (CS) consists of the generation of a personalized learning path for each learner according to one's learner profile. This last one includes one's knowledge and preferences. In fact the CS problem is considered as NP hard problem, so many heuristics and meta-heuristics have been used to approximate its solutions. Therefore the results have shown their efficiency to solve such a problem. This work presents a DNA computing approach that aims to solve the CS problem.

Citation

Debbah, A. & Ben Ali, Y.M. (2014). Solving the Curriculum Sequencing Problem with DNA Computing Approach. International Journal of Distance Education Technologies, 12(4), 1-18. IGI Global. Retrieved August 6, 2024 from https://www.learntechlib.org/p/152465/.

This record was imported from ERIC on November 3, 2015. [Original Record]

ERIC is sponsored by the Institute of Education Sciences (IES) of the U.S. Department of Education.

Copyright for this record is held by the content creator. For more details see ERIC's copyright policy.

Keywords

• Computation
• Computer System Design
• Curriculum
• Efficiency
• electronic learning
• Heuristics
• knowledge management
• Scaling