Search Results - (( using simulation graph algorithm ) OR ( java implementation among algorithm ))
Search alternatives:
- implementation among »
- java implementation »
- simulation graph »
- graph algorithm »
- among algorithm »
-
1
Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm
Published 2008“…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
Get full text
Get full text
Get full text
Thesis -
2
Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site
Published 2017“…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
Get full text
Get full text
Final Year Project -
3
Direct approach for mining association rules from structured XML data
Published 2012“…The thesis also provides a two different implementation of the modified FLEX algorithm using a java based parsers and XQuery implementation. …”
Get full text
Get full text
Thesis -
4
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 -
5
An improved algorithm for channel allocation on direct sequence spread spectrum
Published 2011“…Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
Get full text
Get full text
Thesis -
6
Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph / Mohd Shafiq Mohd Helmi
Published 2012“…The algorithm used to construct the module is Bruijn Graph. …”
Get full text
Get full text
Thesis -
7
Design and analysis of DNA fragment assembly's converter and checker modules using De Bruijin Graph : article / Mohd Shafiq Mohd Helmi
Published 2012“…The algorithm used to construct the module is Bruijn Graph. …”
Get full text
Get full text
Article -
8
Application of computer based simulation in gas network system using graph theory algorithms and numerical methods
Published 2007“…This is causing the other graph theory algorithms remain least known to users. …”
Get full text
Get full text
Thesis -
9
-
10
Laser simulator: a novel search graph-based path planning approach
Published 2018“…In addition, a comparative study on the laser simulator approach, A* algorithm, Voronoi diagram with fast marching and PointBug algorithms was performed to show the benefits and drawbacks of the proposed approach. …”
Get full text
Get full text
Get full text
Article -
11
A Toolkit for Simulation of Desktop Grid Environment
Published 2014“…A simulator for desktop grid environment has been developed using Java as the implementation language due to its wide popularity. …”
Get full text
Get full text
Final Year Project -
12
A hybrid algorithm for finding shortest path in network routing.
Published 2009“…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
Get full text
Article -
13
African Buffalo Optimization (ABO): A New Metaheuristic Algorithm
Published 2015“…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
Get full text
Get full text
Get full text
Article -
14
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 -
15
Scalable workflow scheduling algorithm for minimizing makespan and failure probability
Published 2019“…A simulation-driven analysis based on realistic workflow application was demonstrated using DAG graph as a continuation of the Layered Workflow Scheduling Algorithm (LWFS). …”
Get full text
Get full text
Get full text
Get full text
Article -
16
An Experiment of Ant Algorithms : Case Study of Kota Kinabalu Central Town
Published 2005“…Both algorithms are compared. Simulation is used as a method in this study. …”
Get full text
Get full text
Get full text
Thesis -
17
Spanning Tree Transformation of Connected Graph into Single-Row Network
Published 2010“…Finally, the single-row routing problem is solved using a method called Enhanced Simulated Annealing for Single-Row Routing (ESSR).…”
Get full text
Get full text
Conference or Workshop Item -
18
Efficient signaling schedule for centralized and distributed scheduling algorithms for wimax multi-hop relay networks
Published 2012“…In order to evaluate the proposed algorithms and validate their efficiency for IEEE 802.16j networks, the authors simulated the algorithms in QualNet simulator. …”
Get full text
Get full text
Thesis -
19
A branch and bound and simulated annealing approach for job shop scheduling
Published 2004“…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
Quantum Processing Framework And Hybrid Algorithms For Routing Problems
Published 2010“…The designed hybrid architecture and framework were tested using the above quantum algorithms and the existing quantum algorithms. …”
Get full text
Get full text
Thesis
