Search Results - (( same ((drops algorithm) OR (graph algorithm)) ) OR ( same path algorithm ))

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

“…The proposed test case minimization method has the following steps: provide weight to the paths, calculate path coverage for each path, transform an immediate graph into an adjacency matrix, which later is used to apply firefly algorithm and generate optimal test cases. …”
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

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

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

Token based path allocation approach for mobile robots in sorting centre for achieving high throughput by Khoo, Zong Zheng

“…This project proposes an improved path-finding algorithm that implements token-based path finding while a robot wants to access a grid cell. …”
Get full text
Get full text

Wormhole attack detection mechanism in mobile ad hoc network using neighborhood information and path tracing algorithm by Enshaei, Mehdi

“…Throughput and packet overhead is improved in the NIPT algorithm with an average of 4% and 6% respctively over the PT algorithm. …”
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

Energy balancing mechanisms for decentralized routing protocols in wireless sensor networks by Saleh, Ahmed Mohammed Shamsan

“…The RRSEB operations focus on enhancement of the path recovery process, this is done by introducing proactively route mechanism to create alternative paths together with the data routing obtained by path discovery stage in order to reduce the packet drops. …”
Get full text
Get full text

Algebraic Net Class Rewriting Systems, Syntax and Semantics for Knowledge Representation and Automated Problem Solving by Tirri, Seppo Ilari

“…New results are obtained within construction of problem solving systems where solution algorithms are derived parallel with other candidates applied to the same net classes. …”
Get full text
Get full text

A real-time integrated fire detection and alarm (FDA) system for network based building automation by Anwar, Farhat, Islam, Rounakul, Hussain, Sabahat, Rashid, Muhammad Mahbubur, Shaikh, Zuhaib

“…Methods/Analysis: In this work, the shortest path algorithm was chosen for series of buildings connected by a fiber-optic network. …”
Get full text
Get full text
Get full text

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

End to end performance analysis over IP RAN network / Armi Shahran Mohamad by Mohamad, Armi Shahran

“…For future research, similar scientific analysis will be deploy on Long Term Evolution Network (4G) which is focusing on scheduling algorithms in different traffic conditions such as VoIP and Mix Traffic (Web Browsing, FTP & Steaming).…”
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

Analysis of Dijkstra’s and A* algorithm to find the shortest path by Alija, Amani Saleh

“…There are so many algorithms used to find the shortest path such as Dijkstra, A* algorithm, Genetic algorithm, Floyd algorithm and Ant algorithm. …”
Get full text
Get full text
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

Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

“…If all the robots use the same path planning algorithm, it is possible that they may not bring the greatest benefit. …”
Get full text
Get full text

Performance analysis of genetic algorithm (GA)-based multi-constrained path routing algorithm by Yussof S.

“…The performance of the algorithm is then compared with an exact algorithm called the depth first search and a common shortest path algorithm called the Dijkstra's algorithm. …”

Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

“…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
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