Search Results - same ((crops algorithm) OR (graph algorithm))

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

“…A vertex coloring algorithm has been presented. As a result of applying vertex coloring algorithm no two vertex are to be allocated in same color if they are adjacent in graph. …”
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

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

Find the maximum clique by graph coloring using heuristic greedy by Mustafa, Mamat, Suyudi, ., Sukono, ., Bon, A.T.

“…A vertex coloring algorithm has been presented. As a result of applying vertex coloring algorithm no two vertex are to be allocated in same color if they are adjacent in graph. …”
Get full text
Get full text

VISUALIZATION OF GENETIC ALGORITHM BASED ON 2-D GRAPH TO ACCELERATE THE SEARCHING WITH HUMAN INTERVENTIONS. by FAROOQ, HUMERA

“…A tool termed as VIGA-20 (Visualization of Genetic Algorithm using 2-0 Graph) is implemented to accomplish this goal. …”
Get full text
Get full text

Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics by Al-Araji, Zaid Jasim Mohammed

“…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

Preliminary framework of topology control algorithm in WSN to achieve node's energy efficiency by Shahabuddin, M.Z., Hasbullah, H., Aziz, I.A.

“…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

Test case minimization applying firefly algorithm by Hashim, Nor Laily, Dawood, Yasir Salman

“…Many approaches on test case minimization use genetic algorithms, model checking, or graph search algorithms to reduce the number of generated test cases, also the using of UML diagrams to test the system requirements and design before implementing it in the coding phase.However, these studies lack concentration in achieving higher coverage criteria and minimization in the generated test cases in the same time. …”
Get full text
Get full text
Get full text

An improved algorithm in test case generation from UML activity diagram using activity path by Hashim, Nor Laily, Salman, Yasir D.

“…This paper proposed an improved algorithm to automatically generate test cases directly from UML activity diagram using an activity graph.This algorithm has been implemented as a prototype using UML activity diagrams as inputs to generate test cases.These generated test cases are generated automatically are compared to test cases that are generated manually in order to evaluate the algorithm’s usability and reliability.The result shows that the test cases generated by the developed test case generator program are the same as the one manually derived.…”
Get full text
Get full text
Get full text

Optimised crossover genetic algorithm for capacitated vehicle routing problem by Nazif, Habibeh, Lee, Lai Soon

“…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

GIS-Enhanced Crop Yield Modeling with Machine Learning by Venkatesh, S.D., Chitra, K., Harilakshami, V.M.

“…Many farmers continue to grow the same crops repeatedly without experimenting with new varieties. …”
Get full text
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

Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

“…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

Construction of initial solution population for curriculum-based course timetabling using combination of graph heuristics by Wahid, Juliana, Mohd Hussin, Naimah

“…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

Route optimization using shortest path method / Muhamad Faisal Amin Shakri by Shakri, Muhamad Faisal Amin

“…Each algorithm was tested to compute the shortest path, with results indicating that while all algorithms arrive at the same optimal route, their efficiency differs. …”
Get full text
Get full text

Power system network splitting and load frequency control optimization using ABC based algorithms / Kanendra Naidu a/l Vijyakumar by Vijyakumar, Kanendra Naidu

“…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. The post-islanding frequency stability is maintained by optimizing the Load Frequency Control‘s parameters. …”
Get full text
Get full text

Constructing population of initial solutions for curriculum – based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…The graph coloring heuristics were set as individual, combination of three heuristics. …”
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

MOSDA: A proposal for multiple objective spiral dynamics algorithm by A. R.A., Azwan, Ahmad Nor Kasruddin, Nasir, Sha'akmal, S., A.R.M., Sawal

“…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

Software regression test case prioritization for object-oriented programs using genetic algorithm with reduced-fitness severity by Musa, Samaila, Md Sultan, Abu Bakar, Abd Ghani, Abdul Azim, Baharom, Salmi

“…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