Search Results - (( development program ((graph algorithm) OR (path algorithm)) ) OR ( java _ function algorithm ))
Search alternatives:
- development program »
- function algorithm »
- graph algorithm »
- path algorithm »
-
1
Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming
Published 2016“…Path planning is one of the issues to be handled in the development of autonomous systems. …”
Get full text
Get full text
Article -
2
An improved algorithm in test case generation from UML activity diagram using activity path
Published 2011“…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
Conference or Workshop Item -
3
-
4
Evolutionary cost-cognizant regression test case prioritization for object-oriented programs
Published 2019“…Afterward evolutionary algorithm (EA) was employed to prioritize test cases based on the rate severity of fault detection per unit test cost. …”
Get full text
Get full text
Thesis -
5
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 -
6
Graph coloring program of exam scheduling modeling based on bitwise coloring algorithm using python
Published 2022“…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
Article -
7
Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja
Published 2004“…The development process for this simulation is using programming language of Microsoft Visual C I t 6.0 and the coding creation depends on the algorithm flowchart and the formula pseudocode. …”
Get full text
Get full text
Thesis -
8
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 -
9
Optimizing kindergarten schedule using : graph coloring / Nur Nabilah Salleh Muner
Published 2019“…The greedy algorithm was used to color the graph and it was supported by the C++ program. …”
Get full text
Get full text
Research Reports -
10
Automated path testing using the negative selection algorithm
Published 2017“…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
Get full text
Get full text
Indexed Article -
11
Vision-based robot indoor navigation
Published 2022“…An algorithm is developed in the computer to achieve image processing, user input, path planning, simulation, and writing of output files. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
12
-
13
Scheduling of batch process plant / Abdul Aziz Abu Bakar
Published 1995“…This research work is devoted to software development of scheduling and control algorithm of batch process plant using shortest path method developed by Dijkstra and K* shortest path method developed by Jin Y. …”
Get full text
Get full text
Student Project -
14
Parameter estimation of multivariable system using Fuzzy State Space Algorithm / Razidah Ismail … [et al.]
Published 2011“…The initial phase involved the development of the FSSM of the superheater system. In order to enhance the implementation of the algorithm, it is necesssary to develop an efficient computation program together with the user's interface. …”
Get full text
Get full text
Research Reports -
15
Development of Path Loss Models for Smooth and Convex Surfaces Terrains in Malaysian Environment
Published 2004“…This study describes the development of path loss prediction model for smooth and convex surfaces terrains in Malaysian environment. …”
Get full text
Get full text
Thesis -
16
Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm
Published 2023Article -
17
Modeling of static and dynamic components of bio-nanorobotic systems
Published 2012“…Then, these graph-based structural models of the fullerenes and graph algorithms based on dynamic programming are applied to compute a new set of optimal weighted physical properties of the components including Wiener, hyper-Wiener, Harary and reciprocal Wiener indices as well as Hosoya and hyper-Hosoya polynomials. …”
Get full text
Get full text
Thesis -
18
An Improved of Channel Allocation for WLAN Using Vertex Merge Algorithm
Published 2012“…Graph colouring is a useful algorithm for channel allocation on wireless local area network (WLAN). …”
Get full text
Get full text
Conference or Workshop Item -
19
Enhancement of the scheduling algorithm (software and interfacing development)/ Zuraini Ab Rashid
Published 1996“…This research work describe the enhancement of scheduling algorithm of batch process using shortest path and k th shortest path. …”
Get full text
Get full text
Student Project -
20
Implementation of Autonomous Vehicle Navigation Algorithms Using Event-Driven Programming
Published 2012“…By using FSM to describe the behaviour of a navigating mobile robot, an equivalent algorithm can be developed. The algorithm can be relatively easy translated to a suitable program with event-driven programming technique. …”
Get full text
Get full text
Conference or Workshop Item
