Cart (Loading....) | Create Account
Close category search window
 

Analyzing Convergence in e-Learning Resource Filtering Based on ACO Techniques: A Case Study With Telecommunication Engineering Students

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Munoz-Organero, M. ; Carlos III Univ. of Madrid, Leganes, Spain ; Ramirez, G.A. ; Merino, P.M. ; Kloos, C.D.

The use of swarm intelligence techniques in e-learning scenarios provides a way to combine simple interactions of individual students to solve a more complex problem. After getting some data from the interactions of the first students with a central system, the use of these techniques converges to a solution that the rest of the students can successfully use. This paper uses a case study to analyze how fast swarm intelligence techniques converge when applied to solve the problem of e-learning resource filtering. Some modifications to traditional ant colony optimization (ACO) algorithms based on student filtering are also introduced in order to improve convergence.

Published in:

Education, IEEE Transactions on  (Volume:53 ,  Issue: 4 )

Date of Publication:

Nov. 2010

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.