Search Results - (( systematic implementation matching algorithm ) OR ( java application force algorithm ))

Implementation of case-based reasoning in help desk system by Tee, Shih Min

“…To achieve this aim, CBR algorithm will be studied and implemented in the help desk system to assist the travel agent provide recommendation to customers on selecting the hotel to stay based on customers’ requirements. …”
Get full text
Get full text
Get full text

Dynamic force-directed graph with weighted nodes for scholar network visualization by Mohd. Aris, Khalid Al-Walid, Ramasamy, Chitra, Mohd Aris, Teh Noranis, Zolkepli, Maslina

“…The approach is realized by creating a web-based interface using D3 JavaScript algorithm that allows the visualization to focus on how data are connected to each other more accurately than the conventional lines of data seen in traditional data representation. …”
Get full text
Get full text

Trends on technologies and artificial intelligence in education for personalized learning: systematic literature review by Hashim, Suraya, Omar, Muhd Khaizer, Ab. Jalil, Habibah, Mohd Sharef, Nurfadhlina

“…To gain a better understanding of the concept and implementation of a personalized learning environment employing AI technology, a systematic literature review (SLR) was conducted to identify the trends of technologies and Artificial Intelligence in Education (AIEd) in promoting personalized learning. …”
Get full text
Get full text

Survey on job scheduling mechanisms in grid environment by S. M., Argungu, Che Mohamed Arif, Ahmad Suki, Omar, Mohd Hasbullah

“…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
Get full text
Get full text
Get full text

Computer remote monitoring via mobile phones using socket programming / Samih Omer Fadlelmola Elkhider by Omer Fadlelmola Elkhider, Samih

“…The studies show beyond technical algorithms, physical aspects plays a big rule in client server model. …”
Get full text
Get full text