Search Results - (( same graph algorithm ) OR ( same ((tree algorithm) OR (based algorithm)) ))
Search alternatives:
- graph algorithm »
- tree algorithm »
-
1
Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python
Published 2022“…In this article, the researchers design an algorithm and apply it to a computer program (Python) to solve graph coloring and to visualize the variation of exam scheduling modeling at Binus University in graphs based on the Bitwise Graph Coloring Algorithm. …”
Get full text
Get full text
Get full text
Article -
2
An improved algorithm for channel allocation on direct sequence spread spectrum
Published 2011“…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
Thesis -
3
VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS.
Published 2012“…This comparison is based on the same parameters except for the interactions of the user. …”
Get full text
Get full text
Thesis -
4
Preliminary framework of topology control algorithm in WSN to achieve node's energy efficiency
Published 2016“…The objective of this paper is to propose fundamental modelling of topology control algorithm to conserve individual WSN node's energy, and at the same time preserving the graph connectivity. …”
Get full text
Get full text
Conference or Workshop Item -
5
Optimised crossover genetic algorithm for capacitated vehicle routing problem
Published 2012“…This paper presents a genetic algorithm for solving capacitated vehicle routing problem, which is mainly characterised by using vehicles of the same capacity based at a central depot that will be optimally routed to supply customers with known demands. …”
Get full text
Get full text
Article -
6
Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics
Published 2023“…This study employs use Random Forest algorithm to identify and forecast attacks to dynamically locate the attack location in the network for attack graph analysis. …”
Get full text
Get full text
Get full text
Thesis -
7
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…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
Thesis -
8
Software regression test case prioritization for object-oriented programs using genetic algorithm with reduced-fitness severity
Published 2015“…And even though several of the code based addresses procedural programs. Some researchers addressed the issue of test case prioritization using Genetic Algorithm, but the authors do not select modification-revealing before prioritization and used the same fault severity. …”
Get full text
Get full text
Conference or Workshop Item -
9
Hypergraph-based resource allocation in wireless mesh networks
Published 2017“…In terms of QoS provision with low traffic demands, our algorithm achieved the same results as QACWA and it could guarantee the QoS. …”
Get full text
Get full text
Thesis -
10
Development of a Prediction Algorithm using Boosted Decision Trees for Earlier Diagnoses on Obstructive Sleep Apnea
Published 2018“…This research develops a knowledge-based system by using computational intelligent approaches based on Boosting algorithms on decision trees augmented by pruning techniques and Association Rule Mining. …”
Get full text
Get full text
Thesis -
11
Power system network splitting and load frequency control optimization using ABC based algorithms / Kanendra Naidu a/l Vijyakumar
Published 2015“…This research presents a modified optimization program for the system splitting problem in large scale power system based on Artificial Bee Colony algorithm and graph theory. …”
Get full text
Get full text
Thesis -
12
Development of mobile robot and localization system
Published 2014“…The simulation runs on two different cases that require the mobile robot to move to the target location while the time to accomplish and the distance between the mobile robot center gravity (cog) are taken. Then, the same algorithms are put on the hardware and the experiment runs same as in simulations. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
13
MOSDA: A proposal for multiple objective spiral dynamics algorithm
Published 2018“…A method called “archive method” that is used in multi-objective particle swarm optimization (MOPSO) is adopted into SDA to develop its multiobjective (MO) type algorithm. Moreover, MOSDA is formulated by applying the widely-used concept of Pareto dominance to determine the movement of the particles and at the same time, the algorithm maintains the non-dominated solution in a setup global repository. …”
Get full text
Get full text
Get full text
Article -
14
Resource management in grid computing using ant colony optimization
Published 2011“…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
Monograph -
15
Classification of breast cancer disease using bagging fuzzy-id3 algorithm based on fuzzydbd
Published 2022“…ID3 has the most advantages among the three algorithms, especially in processing time, as it builds the fastest tree with short depth. …”
Get full text
Get full text
Thesis -
16
Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan
Published 2017“…After reviewing various algorithms, it was decided to apply de Bruijn graphs and Eulerian circuits that are based on graph theory. …”
Get full text
Get full text
Thesis -
17
Constructing population of initial solutions for curriculum – based course timetabling problem
Published 2012“…Future work will use the best settings of heuristics to the improvement phase in population-based improvement algorithm.…”
Get full text
Get full text
Conference or Workshop Item -
18
Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics
Published 2016“…The construction of population of initial solution is a crucial task in population-based metaheuristic approach for solving curriculum-based university course timetabling problem because it can affect the convergence speed and also the quality of the final solution.This paper presents an exploration on combination of graph heuristics in construction approach in curriculum based course timetabling problem to produce a population of initial solutions.The graph heuristics were set as single and combination of two heuristics.In addition, several ways of assigning courses into room and timeslot are implemented.All settings of heuristics are then tested on the same curriculum based course timetabling problem instances and are compared with each other in terms of number of population produced.The result shows that combination of largest degree followed by saturation degree heuristic produce the highest number of population of initial solutions.The results from this study can be used in the improvement phase of algorithm that uses population of initial solutions…”
Get full text
Get full text
Get full text
Article -
19
Classification of fault and stray gassing in transformer by using duval pentagon and machine learning algorithms
Published 2022“…The algorithms that will be used include boosted trees, RUS boosted trees and subspace KNN, which belongs to the same ensemble group. …”
Get full text
Get full text
Article -
20
Optimizing tree planting areas through integer programming and improved genetic algorithm
Published 2012“…In conclusion, the hybrid algorithm based solution strategies improved efficiency with convincing results, therefore, this will assist planners for better decision making to optimize area to achieve more trees to be planted. …”
Get full text
Get full text
Thesis
