Search Results - (( using solution graph algorithm ) OR ( java implementation level algorithm ))

AUTOMATED MODEL GENERATION OF FSM AND NUSMV MODEL FROM RSA JAVA SOURCE CODE FOR MODEL CHECKING by SALLEH AL-HUMAIKANI, MOHAMMED ABDULQAWI

“…The encryption algorithms are playing an important part in the protection level for data. …”
Get full text
Get full text

Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

Get full text
Get full text

VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

“…A tool termed as VIGA-20 (Visualization of Genetic Algorithm using 2-0 Graph) is implemented to accomplish this goal. …”
Get full text
Get full text

Multiregion segmentation of mammogram images by using parametric kernel graph cut algorithm / Nurhanani Abdul Rahim, Nor Farah Nabilah Mushtafa and Nadhirah Afiqah Zailan by Abdul Rahim, Nurhanani, Mushtaf, Nor Farah Nabilah, Zailan, Nadhirah Afiqah

Get full text
Get full text

Implementation of (AES) Advanced Encryption Standard algorithm in communication application by Moh, Heng Huong

“…Internet communication has become more common in this modern world recently, and one of the important algorithms used is ABS algorithm. However, most of the users have inadequate knowledge and understanding regard to this algorithm implementation in the communication field, as well as the level of security and accuracy will be questioned by the users because of the necessary to maintain the confidentiality of particular data transferred. …”
Get full text
Get full text

Optimizing boarding school schedule using graph coloring: case study of Sekolah Menengah Sultan Abdul Halim / Nur Farhana Mohd Asri by Mohd Asri, Nur Farhana

Get full text
Get full text

Performance analyses of graph heuristics and selected trajectory metaheuristics on examination timetable problem by Mandal, Ashis Kumar, M. N. M., Kahar

“…For constructing the feasible solution, six graph heuristics are used. They are largest degree (LD), largest weighted degree (LWD), largest enrolment degree (LE), and three hybrid heuristic with saturation degree (SD) such as SD-LD, SD-LE, and SD-LWD. …”
Get full text
Get full text
Get full text

Performance analysis of graph heuristics and selected trajectory metaheuristics on examination timetable problem by Mandal, Ashis Kumar, Mohd Nizam Mohmad, Kahar

“…For constructing the feasible solution, six graph heuristics are used. They are largest degree (LD), largest weighted degree (LWD), largest enrolment degree (LE), and three hybrid heuristics with saturation degree (SD) such as SD-LD, SD-LE, and SD-LWD. …”
Get full text
Get full text
Get full text

Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

“…Results of the experiments that were conducted using various data sets showed that the proposed algorithm produced better course schedule solution than the Greedy Algorithm, Genetic Algorithm, and other variants of Ant System Algorithm.…”
Get full text
Get full text
Get full text

Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

“…It does not consider the LACE algorithm implemented in huge number of server in one Cloud datacenter. …”
Get full text
Get full text

Hybrid bat algorithm for minimum dominating set problem by Abed, S.A., Rais, H.M.

“…However, population-based algorithms are not good in exploiting the search space in comparison to single-solution based methods, therefore we included simulated annealing (SA) algorithm to balance between exploitation and exploration in order to reach a best possible solution. …”
Get full text
Get full text

Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics by Wahid, Juliana, Mohd Hussin, Naimah

“…The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions…”
Get full text
Get full text
Get full text

Graph theory approach for managing lecturers’ schedule using graph colouring method / Siti Nor Ba Basri, Nur Su’aidah Khozaid and Farhana Hazwani Ismail by Basri, Siti Nor Ba, Khozaid, Nur Su’aidah, Ismail, Farhana Hazwani

“…Different colours are allocated to each vertex using graph colouring techniques such as the vertices algorithm or the edges algorithm, ensuring that clashing courses and lecturers are assigned different time slots. …”
Get full text
Get full text

A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

“…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
Get full text
Get full text

A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

“…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
Get full text
Get full text

Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

“…This paper describes our project that has the ultimate goal of providing optimized solutions for enterprise network security. We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text

Attack path selection optimization with adaptive genetic algorithms by Abd Rahman, A.S., Zakaria, M.N., Masrom, S.

“…This paper describes our project that has the ultimate goal of providing optimized solutions for enterprise network security. We describe our approach for implementing an optimized security assessment using Genetic Algorithm (GA). …”
Get full text
Get full text

A Model for Evaluation of Cryptography Algorithm on UUM Portal by Norliana, Abdul Majid

“…Level one is the development of userID and password, level two involve the insertion of the testing parameter speed coding. …”
Get full text
Get full text
Get full text

Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application by Yana Aditia, Gerhana, Nur, Lukman, Arief Fatchul, Huda, Cecep Nurul, Alam, Undang, Syaripudin, Devi, Novitasari

“…Performance Testing is used to test the performance of algorithm implementations in applications. The test results show that the Boyer Moore and Knuth Morris Pratt algorithms have an accuracy rate of 100%, and the Horspool algorithm 85.3%. …”
Get full text
Get full text

An improved RSA cryptosystem based on thread and CRT / Saheed Yakub Kayode and Gbolagade Kazeem Alagbe by Yakub Kayode, Saheed, Kazeem Alagbe, Gbolagade

“…We use a parallel technique that divides RSA power process into seperate threads and employs the use of Chinese Remainder Theorem (CRT) to decrease the time required for both encryption and decryption operation. Java programming language is used to implement the algorithm. …”
Get full text
Get full text
Get full text