Search For:

Displaying 1-5 out of 5 total
A Rule-Based Approach for Developing a Competency-Oriented User Model for E-Learning Systems
Found in: Internet and Web Applications and Services, International Conference on
By Mihaela Brut, Laura Asandului, Gheorghe Grigoras
Issue Date:May 2009
pp. 555-560
The present paper exposes a two layer user model (competences and interests) expressed through ontological constructs. As well, the paper illustrates a rule-based solution for developing the user profile in the context of the e-learning systems. The user m...
 
A Competency-Oriented Modeling Approach for Personalized E-Learning Systems
Found in: Internet and Web Applications and Services, International Conference on
By Mihaela Brut, Sabin Buraga, Sergiu Dumitriu, Gheorghe Grigoras, Marta Girdea
Issue Date:June 2008
pp. 410-415
In order to optimize the information retrieval and adaptation facilities inside an e-learning system, there is necessary to improve accessibility and to correlate the educational materials, the users and the information. For this purpose, we present a sema...
 
An Efficient Scheduling Algorithm for the Multiprocessor Platform
Found in: Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on
By Stefan Andrei, Albert M.K. Cheng, Gheorghe Grigoras, Vlad Radulescu
Issue Date:September 2010
pp. 245-252
Given a task set T, determining the number of processors leading to a feasible schedule for T is an important problem in the real-time embedded systems community. For periodic and independent task sets, the utilization rate represents a lower bound on the ...
 
A Hierarchy of Tractable Subclasses for SAT and Counting SAT Problems
Found in: Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on
By Stefan Andrei, Gheorghe Grigoras, Martin Rinard, Roland Hock Chuan Yap
Issue Date:September 2009
pp. 61-68
Finding subclasses of formulae for which the SAT problem can be solved in polynomial time has been an important problem in computer science. We present a new hierarchy of propositional formulæ subclasses for which the SAT and counting SAT problems can be s...
 
A Rewrite Stack Machine for ROC!
Found in: Symbolic and Numeric Algorithms for Scientific Computing, International Symposium on
By Georgiana Caltais, Eugen-Ioan Goriac, Dorel Lucanu, Gheorghe Grigoras
Issue Date:September 2008
pp. 85-91
\ROC is a deterministic rewrite strategy language which includes the rewrite rules as basic operators, and the deterministic choice and the repetition as high-level strategy operators. In this paper we present a method which, for a given term rewriting sys...
 
 1