Search Results - (( ((problems using) OR (process using)) 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

“…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
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

“…This thesis proposes a graph processing hardware accelerator for shortest path algorithms applied in nanometer VLSI interconnect routing problems. …”
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.

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

Image matching using relational graph representation by Lai, Chui Yen

“…Feature-based matching algorithm cannot tackle the problem of matching ambiguities easily. …”
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

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

“…The designed hybrid architecture and framework were tested using the above quantum algorithms and the existing quantum algorithms. …”
Get full text
Get full text

Dissimilarity algorithm on conceptual graphs to mine text outliers by Kamaruddin, Siti Sakira, Hamdan, Abdul Razak, Abu Bakar, Azuraliza, Mat Nor, Fauzias

“…The graphical text representation method such as Conceptual Graphs (CGs) attempts to capture the structure and semantics of documents.As such, they are the preferred text representation approach for a wide range of problems namely in natural language processing, information retrieval and text mining.In a number of these applications, it is necessary to measure the dissimilarity (or similarity) between knowledge represented in the CGs.In this paper, we would like to present a dissimilarity algorithm to detect outliers from a collection of text represented with Conceptual Graph Interchange Format (CGIF).In order to avoid the NP-complete problem of graph matching algorithm, we introduce the use of a standard CG in the dissimilarity computation.We evaluate our method in the context of analyzing real world financial statements for identifying outlying performance indicators.For evaluation purposes, we compare the proposed dissimilarity function with a dice-coefficient similarity function used in a related previous work.Experimental results indicate that our method outperforms the existing method and correlates better to human judgements. …”
Get full text
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

“…The Traveling Salesman Problem (TSP) is one of the most well-known NP-hard optimization problems. …”
Get full text
Get full text
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

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

Computational comparison of major proposed methods for graph partitioning problem by Rais, H.M., Abed, S.A., Watada, J.

“…The approximate methods constitute a useful solution for these types of problems. Thus, many research studies have focused on developing meta-heuristic algorithms to tackle the graph partitioning problem. …”
Get full text
Get full text

Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

“…Using this encoding scheme would enable researchers to solve other hard problems whilst also improving the algorithm.…”
Get full text
Get full text

Using graph algorithm and classification technique for finding an optimal bus route in time-dependent travel times by Deelertmongkolchai, Satjayod, Chumwatana, Todsanai, Thaiupathump, Choonhapong

“…However, they are suffering from the long hours in traffic jam especially in rush hour.They also cannot avoid this such jam as bus routes are fixed by Bangkok Mass Transit Authority (BMTA).This paper aims to propose a technique for finding an Optimal Bus Route in Time-Dependent Travel Times by using graph algorithm and data mining technique. …”
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

Automatic clustering of gene ontology by genetic algorithm by Othman, Razib M., Deris, Safaai, Zakaria, Zalmiyah, Illias, Rosli M., Mohamad, Saberi M.

“…Additionally, deciding the number k of clusters to use is not easily perceived and is a hard algorithmic problem. …”
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