Solving the Curriculum Sequencing Problem with DNA Computing Approach

Autor/inn/en	Debbah, Amina; Ben Ali, Yamina Mohamed
Titel	Solving the Curriculum Sequencing Problem with DNA Computing Approach
Quelle	In: International Journal of Distance Education Technologies, 12 (2014) 4, S.1-18 (19 Seiten)Infoseite zur Zeitschrift PDF als Volltext Verfügbarkeit
Sprache	englisch
Dokumenttyp	gedruckt; online; Zeitschriftenaufsatz
ISSN	1539-3100
DOI	10.4018/ijdet.2014100101
Schlagwörter	Electronic Learning; Curriculum; Computer System Design; Heuristics; Efficiency; Computation; Knowledge Management; Scaling + Suchen Sie Ihr Suchwort? Curricula; Lehrplan; Rahmenplan; Heuristik; Effectiveness; Effektivität; Wirkungsgrad; Wissensmanagement; Scale construction; Skalenkonstruktion
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. (As Provided).
Anmerkungen	IGI Global. 701 East Chocolate Avenue, Hershey, PA 17033. Tel: 866-342-6657; Tel: 717-533-8845; Fax: 717-533-8661; Fax: 717-533-7115; e-mail: journals@igi-global.com; Web site: http://www.igi-global.com/journals
Erfasst von	ERIC (Education Resources Information Center), Washington, DC
Update	2020/1/01