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

Benchmark simulator with dynamic environment for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana

“…Job scheduling algorithm has a significant influence on grid computing performance. …”
Get full text
Get full text
Get full text

Analysis and modeling of database storage optimization power consumption usage for green data centers by Wan Noor Hamiza, Wan Ali

“…The proxies can be discovered by using a developed algorithm of functional dependencies (FDs) called as TANE algorithm. …”
Get full text
Get full text
Get full text
Get full text

Modified And Ensemble Intelligent Water Drop Algorithms And Their Applications by O. F. Alijla, Basem

“…The Intelligent Water Drop (IWD) algorithm is a swarm-based model that is useful for undertaking optimization problems. …”
Get full text
Get full text

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.

Intelligent Examination Timetabling System Using Hybrid Intelligent Water Drops Algorithm by AlDeeb, BA, Norwawi, NM, Al-Betar, MA, Jali, MZ

Subjects:

Solving university examination timetabling problem using intelligent water drops algorithm by Aldeeb B.A., Norwawi N.M., Al-Betar M.A., Jali M.Z.B.

Subjects: “…Intelligent water drops algorithm…”

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

Hybrid Improved Bacterial Swarm Optimization Algorithm for Hand-Based Multimodal Biometric Authentication System by Shanmugasundaram, Karthikeyan, Mohmed, Ahmad Sufril Azlan, Ruhaiyem, Nur Intan Raihana

“…The hybridization of the algorithm was conducted by incorporating Bacterial Foraging Optimization (BFO) and Particle Swarm Optimization (PSO) algorithm to mitigate weaknesses in slow and premature convergence. …”
Get full text
Get full text

Hybrid Intelligent Water Drops Algorithm For Examination Timetabling Problem by Bashar A.Aldeeb, Mohammed Azmi Al-Betar, Norita Md Norwawi, Khalid A.Alissa, Mutasem K.Alsmadi, Ayman A.Hazaymeh, Malek Alzaqebah

Subjects: “…Examination Time table, Intelligent Water Drops algorithm, Metaheuristic, Locale search algorithm, Optimization…”

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

Get full text
Get full text