Solving the Curriculum Sequencing Problem with DNA Computing Approach

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 gene...

Full description

Saved in:
Bibliographic Details
Published in:International journal of distance education technologies 2014-10, Vol.12 (4), p.1-18
Main Authors: Debbah, Amina, Ben Ali, Yamina Mohamed
Format: Article
Language:English
Subjects:
Approximation
Computation
Computer System Design
Curricula
Curriculum
Customization
Deoxyribonucleic acid
Distance education
Distance learning
Efficiency
Electronic Learning
Gene sequencing
Heuristics
Knowledge Management
Learning
Methods
Personalized
Scaling
Sequencing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1539-3100
1539-3119
DOI:10.4018/ijdet.2014100101