Search Results - (( java implementation search algorithm ) OR ( problem implementation graph algorithm ))

An Edge-Wise Linear Shortest Path Algorithm for Non-Negative Weighted Undirected Graphs by Qureshi, M.A., Hassan, M.F., Safdar, S., Akbar, R., Sammi, R.

“…The main advantage of the algorithms is its simplicity and it does not need complex data structures for implementations.…”
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

“…This study aims to compare the performance of Boyer-Moore, Knuth morris pratt, and Horspool algorithms in searching for the meaning of words in the Java-Indonesian dictionary search application in terms of accuracy and processing time. …”
Get full text
Get full text

Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

“…This project implement a algorithm for the optimal transistor chaining problem in CMOS functional cell layout based on Uehara and vanCleemput's layout style [1] which assumed that the height of each logic module layout is constant and performed the optimisation by decomposing the graph module into a minimum number of sub graph having a dual Euler (d-Euler) trail.. …”
Get full text
Get full text

An enumerative algorithm for the maximum clique problem by Mustafa, Mamat, Suyudi, M., Sukono, ., Bon, A.T.

“…Partial enumerative algorithms are presented for maximum clique problems which are very easy to implement. …”
Get full text
Get full text

Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

“…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
Get full text
Get full text

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

“…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
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

“…The result has shown that the Greedy Algorithm has succeeded to produce the lowest minimal color compared to Graph Coloring Algorithm. …”
Get full text
Get full text

A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

“…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
Get full text

Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

“…Another quantum algorithm for a minimum weight spanning tree in the graph was also designed. …”
Get full text
Get full text

A quantum algorithm for minimal spanning tree by Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

“…Quantum computing algorithms are considered for several problems in graph theory. …”
Get full text
Get full text

Bipartite graph approach to course timetabling problems / Hafizah A Razak by A Razak, Hafizah

“…Future research also can be carried out on the timetabling problems implementing other approaches.…”
Get full text
Get full text

Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions by Ahmed, Mashuk, Nasser, Abdullah B., Kamal Z., Zamli, Heripracoyo, Sulistyo

“…This paper aims to compare the performance of two metaheuristic algorithms which are Jaya Algorithm (JA) and Cuckoo Search (CS) using some common benchmark functions. …”
Get full text
Get full text
Get full text
Get full text

Synthesis of transistor chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

Get full text
Get full text

Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site by TANG, HON PANN

Get full text
Get full text

Songs Search Using Human Humming Voice by Abdul Rahman, Mohamad Ariff

Get full text
Get full text

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

“…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
Get full text
Get full text
Get full text

Partial examination assignment approaches for solving examination timetabling problems by Mandal, Ashis Kumar

“…The entire process runs until all of the examinations are assigned successfully. We have implemented partial graph heuristic with hill climbing (PGH-HC) and partial graph heuristic with modified great deluge algorithm (PGH-mGD) into solving the examination timetabling. …”
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

Combination of Graph Heuristic with Hill Climbing Search for Solving Capacitated Examination Timetabling Problem by Ashis Kumar, Mandal, M. N. M., Kahar

“…The algorithm starts with ordering all the exams according to graph heuristic approach and then partial exams are considered for construction. …”
Get full text
Get full text
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