Search Results - (( java implication based algorithm ) OR ( using complete graph algorithm ))
Search alternatives:
- implication based »
- java implication »
- graph algorithm »
- using complete »
-
1
Frequent itemset mining using graph theory / Mohammad Arsyad Mohd Yakop
Published 2017“…The Directed Acyclic Graph in High Dimensional Dataset Mining (DAGHDDM) is a graph-based mining algorithm that represents itemsets in complete graph before FIM takes place. …”
Get full text
Get full text
Thesis -
2
On some packing and partition problems in geometric graphs
Published 2018“…In this thesis, packing and partition problems are studied for different properties such as matching, tree and cycle, and these problems are considered in various geometric graphs. The families of geometric graphs that are investigated include the complete geometric graphs, triangle-free geometric graphs, and complete bipartite geometric graphs. …”
Get full text
Get full text
Thesis -
3
The construction of distinct circuits of length six for complete graph K6
Published 2015“…Along this process, the adjacency matrices will be used to clarify distinct structures of circuits in a complete graph of length six.…”
Get full text
Get full text
Get full text
Article -
4
-
5
Dissimilarity algorithm on conceptual graphs to mine text outliers
Published 2009“…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
Conference or Workshop Item -
6
Representation of half wing of butterfly and hamiltonian circuit for complete graph using starter set method
Published 2019“…Several interesting and challenging methods have used to formulate distinct circuits but this research is motivated through the process of wings movement in butterfly to develop distinct circuits from complete graphs. …”
Get full text
Get full text
Get full text
Article -
7
A genetic algorithm on single machine family scheduling problem to minimise total weighted completion time
Published 2009“…For this problem, we propose a genetic algorithm using an optimised crossover operator designed by an undirected bipartite graph to find an optimal schedule which minimises the total weighted completion time of the jobs in the presence of the sequence independent family setup times. …”
Get full text
Get full text
Article -
8
A multi-view clustering algorithm for attributed weighted multi-edge directed networks
Published 2022“…Our algorithm first converts the given AWMEDiG into a new weighted graph. …”
Get full text
Get full text
Article -
9
Hybrid bat algorithm for minimum dominating set problem
Published 2017“…Graph domination is one of the NP-Complete problems that cannot be solved exactly in polynomial time. …”
Get full text
Get full text
Article -
10
Genetic algorithms for single machine family scheduling problems with maximum lateness and completion time
Published 2010Get full text
Working Paper -
11
Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems
Published 2021“…Travelling salesman problem (TSP) is one the problems of NP-complete family, which means finding shortest complete close tour in the graph. …”
Get full text
Get full text
Get full text
Article -
12
Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method
Published 2018“…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
Thesis -
13
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…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
Monograph -
14
The conceptual framework of knowledge of large scale and incomplete graphs of skyline queries optimization using machine learning
Published 2025“…The preliminary results using the K means Clustering Algorithm showed that the conceptual framework successfully grouped similar data points, facilitating the identification of skyline points. …”
Get full text
Get full text
Get full text
Get full text
Proceeding Paper -
15
Optimised crossover genetic algorithm for capacitated vehicle routing problem
Published 2012“…The proposed algorithm uses an optimised crossover operator designed by a complete undirected bipartite graph to find an optimal set of delivery routes satisfying the requirements and giving minimal total cost. …”
Get full text
Get full text
Article -
16
Power system intentional islanding for different contingency scenarios using discrete optimization technique
Published 2023“…The initial intentional islanding solution was determined using graph theory approach, to facilitate the proposed MDEP algorithm in determining the optimal intentional islanding strategy. …”
text::Thesis -
17
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…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
Thesis -
18
Computational comparison of major proposed methods for graph partitioning problem
Published 2019“…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
Article -
19
A branch and bound and simulated annealing approach for job shop scheduling
Published 2004“…The objective is to schedule the jobs on the machines so that the total completion time is minimized. In the branch and bound approach, the job shop scheduling problem is represented by a disjunctive graph, then the optimal schedule is obtained using the branch and bound algorithm while simulated annealing is a local search based algorithm which will slightly perturb the initial feasible solution to decrease the makespan. …”
Get full text
Get full text
Article -
20
Resource management in grid computing using ant colony optimization
Published 2011“…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
Monograph