Search Results - optimal ((graph algorithm) OR (computer algorithm))

African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

“…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
Get full text
Get full text
Get full text

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…This research proposes an enhancement of the ant colony optimization algorithm that caters for dynamic scheduling and load balancing in the grid computing system. …”
Get full text
Get full text
Get full text

Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

“…To address this issue, this study incorporated joint graph learning from the gmc algorithm into swmcan, creating a new algorithm called swmcan-jg. …”
Get full text
Get full text

A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid... by Mohammad Zahid, Munashahira

“…This study meticulously evaluates each algorithm’s computational efficiency, implementation complexity, and performance in generating optimal routes.…”
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

Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

“…The first modeling technique applies graph algorithms to compute a new set of optimal weighted structural properties of C60 and C70 fullerenes. …”
Get full text
Get full text

Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems by Fayaz, Muhammad, Arshad, S, Shah, A.S, Shah, Asadullah

“…Hence, these approaches regularly fail to provide optimal results on specific graph instances. These problems motivated to propose Max Degres Around (MDA) approximation algorithm for the MVC problem. …”
Get full text
Get full text
Get full text

An optimal approximation algorithm for optimization of un-weighted minimum vertex cover problem by Fayaz, Muhammad, Arshad, S, Shah, Abdul Salam, Shah, Asadullah

“…Mean of Neighbors of Minimum Degree Algorithm (MNMA) is proposed in this paper. The MNMA produces optimal or near optimal vertex cover for any known undirected, un-weighted graph. …”
Get full text
Get full text
Get full text

A comparative study of greedy algorithms and dynamic programming in road network / Nuralya Sofea Hairulanuar by Hairulanuar, Nuralya Sofea

“…The Bellman Ford algorithm is notable for its capability to manage graphs with negative weights, however it is less efficient than Dijkstra's algorithm for graphs with non-negative weights. …”
Get full text
Get full text

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system. …”
Get full text
Get full text
Get full text

A Hybrid ACO-Graph Entropy for Functional Modules Detection From Protein-Protein Interaction Network by Jamaludin, Sallim, Rozlina, Mohamed, Che, Yahaya, Roslina, Abdul Hamid

“…The Ant Colony Optimization (ACO) Algorithm has been adapted for the protein functional module detection by modeling the problem as an optimization problem. …”
Get full text
Get full text
Get full text

Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling by Mohammad Pour, Shahrzad

Get full text
Get full text

Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner by Salleh Muner, Nur Nabilah

“…The greedy algorithm was used to color the graph and it was supported by the C++ program. …”
Get full text
Get full text

An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs by Md Yunos, Norhazwani, Shurbevski, Aleksandar, Nagamochi, Hiroshi

“…While the base of the exponent in the running time bound of our algorithm is greater than 2, it still outperforms Gurevich and Shelah’s O∗(4nnlog n) polynomial-space exact algorithm for the TSP in general graphs (SIAM Journal of Computation, Vol.16, No.3, pp.486–502, 1987). …”
Get full text
Get full text
Get full text
Get full text

Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

“…Each algorithm was tested to compute the shortest path, with results indicating that while all algorithms arrive at the same optimal route, their efficiency differs. …”
Get full text
Get full text

Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
Get full text
Get full text
Get full text
Get full text

Enhancing three variants of harmony search algorithm for continuous optimization problems by Alomoush, Alaa A., Alsewari, Abdulrahman A., Kamal Z., Zamli, Alrosan, Ayat, Alomoush, Waleed, Alissa, Khalid

“…Meta-heuristic algorithms are well-known optimization methods, for solving real-world optimization problems. …”
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

“…In the benchmark paper, the result of implementation of LACE algorithm in 400, 600, 800 and 1000 servers were plotted at different graphs. …”
Get full text
Get full text

An online density-based clustering algorithm for data stream based on local optimal radius and cluster pruning by Islam, Md Kamrul

“…This algorithm maintains the local optimal radius of micro-clusters rather than a global and constant radius. …”
Get full text
Get full text