81 search results - page 1 / 17 » A Shortest Learning Path Selection Algorithm in E-learning |
ICALT
2006
IEEE
13 years 10 months ago
2006
IEEE
Generally speaking, in the e-learning systems, a course is modeled as a graph, where each node represents a knowledge node (KU) and two nodes are connected to form a semantic netw...
OTM
2010
Springer
13 years 2 months ago
2010
Springer
The GRASIM (Graph-Aided Similarity calculation) algorithm is designed to solve the problem of ontology-based data matching. We subdivide the matching problem into the ones of restr...
WEBI
2005
Springer
13 years 10 months ago
2005
Springer
Over the last years, we have witnessed an explosive growth of e-learning. More and more learning contents have been published and shared over the Internet. Therefore, how to progr...
COSIT
2003
Springer
13 years 9 months ago
2003
Springer
Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
OL
2011
12 years 11 months ago
2011
In this paper, we study a minimum Connected Dominating Set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pa...