Search Results - (( developing computer graph algorithm ) OR ( java application based algorithm ))

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

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

“…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
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

Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

“…Graphs are pervasive data structures in computer science, and algorithms working with them are fundamental to the field. …”
Get full text
Get full text
Get full text

Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python by Arifin, Samsul, Muktyas, Indra Bayu, Al Maki, Wikky Fawwaz, Mohd Khairul Bazli, Mohd Aziz

“…The researchers develop a graph coloring algorithm by considering some of the graph vertices to be binary numbers. …”
Get full text
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

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

Get full text
Get full text

An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

“…Meanwhile between the VMA and Dsatur algorithm in the complex graph is equivalent to 18.1%.However,VMA and Welsh Powell algorithm is not compared in the complex graph since its drawback in terms of not fulfill the graph coloring concept.This is because there are two adjacent vertices have the same color.Overall, even there is no reduction for number of required channel among VMA,Dsatur algorithm and Welsh Powell algorithm in the simple graph,but the outstanding significant contribution of VMA since it has reduction in the complex graph.…”
Get full text
Get full text

Application of computer based simulation in gas network system using graph theory algorithms and numerical methods by Poh, Hong Hwee

“…The objectives of this research are to determine the fastest graph theory algorithm , and to determine the fastest and the most accurate numerical method, in the development of gas network computer simulator. …”
Get full text
Get full text

An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm by Mr, Handrizal, Mr, Muhammad Zarlis, Noraziah, Ahmad, Abdalla, Ahmed N.

“…A series of experiment was carried out by using one computer. Vertex Merge Algorithm (VMA) simulation is developed under Linux platform. …”
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

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

COVID-19 DATA EXPLORATION USING MAPPER ALGORITHM by Carey, Ling Yu Fan

Get full text
Get full text

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

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.

Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

“…In order to address the high computation time, an improved VG called Iterative Equilateral Spaces Oriented Visibility Graph (IESOVG) has been developed by reducing the number of obstacles used for path planning. …”
Get full text
Get full text
Get full text
Get full text

RSA Encryption & Decryption using JAVA by Ramli, Marliyana

“…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
Get full text
Get full text

Parameter estimation of multivariable system using Fuzzy State Space Algorithm / Razidah Ismail … [et al.] by Ismail, Razidah, Ahmad, Tahir, Harish, Noor Ainy, A. Halim, Rosenah

“…The initial phase involved the development of the FSSM of the superheater system. In order to enhance the implementation of the algorithm, it is necesssary to develop an efficient computation program together with the user's interface. …”
Get full text
Get full text

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

“…This research starts with developing an algorithm based on original concept of Ant System Algorithm. …”
Get full text
Get full text
Get full text

Dynamical fuzzy autocatalytic set of combustion process in circulating fluidized bed boiler using transition matrix / Hazwani Hashim by Hashim, Hazwani

“…The improvised GDAis able to reduce computer running time as compared to previous algorithm and able to deals with a sparse graph. …”
Get full text
Get full text