Search Results - (( problem using ((gray algorithm) OR (graph algorithm)) ) OR ( java application using algorithm ))

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

“…The resource allocation 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

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

“…The resource allocation problem is modelled 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. …”
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

Algoritma Pengekstrakan Imej Cap Jari Berdasarkan Analisa Variasi Arah by Nurzaid, Muhd. Zain

“…As a result, an extraction algorithm capable of extracting a skeleton structure from a digital 256 gray level fingerprint image was developed. …”
Get full text
Get full text
Get full text

Enhanced Clustering Algorithms For Gray-Scale Image Segmentation by Siddiqui, Fasahat Ullah

Get full text
Get full text

A New Approach in a Gray-Level Image Contrast Enhancement by using Fuzzy Logic Technique by Hussain K., Khaleaf, Kamarul Hawari, Ghazali, Mithaq Na'ma, Raheema, Abdalla, Ahmed N.

“…Fuzzy Logic technique represents a new approach for gray level image contrast enhancement. The image contrast problem is one of the main problems that confront the researchers in the field of digital image processing, such as in the biomedical image processing like X-Ray and MRI image segmentation for disease classification. …”
Get full text
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

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

“…Many challenging problems in Very Large-Scale Integration (VLSI) physical design automation are modeled using graphs. …”
Get full text
Get full text
Get full text

Graph algorithm vertex coloring by Suyudi, M., Sukono, ., Mustafa, Mamat, Bon, A.T.

“…Graph coloring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems.…”
Get full text
Get full text

On some packing and partition problems in geometric graphs by Trao, Hazim Michman

“…Graph packing problem refers to the problem of finding maximum number of edge-disjoint copies of a fixed subgraph in a given graph G. …”
Get full text
Get full text

Taguchi-Grey Relational Analysis Method for Parameter Tuning of Multi-objective Pareto Ant Colony System Algorithm by Muthana, Shatha Abdulhadi, Ku Mahamud, Ku Ruhana

“…These values can be benchmarked in solving multi-objective GMS problems using the multi-objective PACS algorithm and its variants.…”
Get full text
Get full text
Get full text

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

“…Although the swmcan algorithm solves the noise problem in multi-view data, its initial and final graphs are independent and cannot learn from each other. …”
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.

Branch and bound algorithm for finding the maximum clique problem by Suyudi, M., Sukono, ., Mamat, M., Bon, A.T.

“…We present a branch and bound algorithm for the maximum clique problem in arbitrary graphs. …”
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

“…Greedy Algorithm is used to solve the Vertex Coloring approach meanwhile Graph Coloring Algorithm is used to solve the Edge Coloring approach. …”
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

“…Greedy Algorithm is used to solve the Vertex Coloring approach meanwhile Graph Coloring Algorithm is used to solve the Edge Coloring approach. …”
Get full text
Get full text

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

“…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
Get full text
Get full text

The graph heuristic with great deluge algorithm to solve the ITC2007 examination timetabling problem by Chuan, Wei Kiat

“…The graph heuristic with great deluge algorithm will be used to solve this problem. …”
Get full text
Get full text

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

“…Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
Get full text
Get full text

Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop by Mohd Yakop, Mohammad Arsyad

“…_We proposed a novel frequent itemset mining using a graph theory called Frequent Row Graph Closed (FRG-Closed). …”
Get full text
Get full text