Search Results - (( simulation optimization method algorithm ) OR ( using computational graph algorithm ))
Search alternatives:
- computational graph »
- method algorithm »
- graph algorithm »
-
1
Route optimization using shortest path method / Muhamad Faisal Amin Shakri
Published 2025“…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
Thesis -
2
Modeling of static and dynamic components of bio-nanorobotic systems
Published 2012“…The first modeling technique applies graph algorithms to compute a new set of optimal weighted structural properties of C60 and C70 fullerenes. …”
Get full text
Get full text
Thesis -
3
Quality of service in mobile IP networks with parametric multi-channel routing algorithms based on linear programming approach
Published 2018“…Furthermore, Optimized Parametric Topology Control Routing algorithm performs significantly better than Triangular Routing Method and Change Foreign Agent Algorithm. …”
Get full text
Get full text
Thesis -
4
PAPR Reduction Using Genetic Algorithm (GA) In OFDM System
Published 2018“…In this thesis, a Genetic algorithm (GA) technique is proposed. GA is a type of optimization algorithm, which is natural-based selection and is used to find the optimal solution to the computational problem that maximizes or minimizes a particular function. …”
Get full text
Get full text
Monograph -
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
DNA sequence design for direct-proportional length-based DNA computing: Particle swarm optimization vs population based ant colony optimization
Published 2012“…Generally, in DNA computing, the DNA sequences used for the computation should be critically designed in order to reduce error that could occur during computation. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
Reducing network congestion by separating nets of single-row networks into layers
Published 2011“…Optimal results for a single layer network have been achieved through a model called Enhanced Simulated Annealing Single-row Routing (ESSR). …”
Get full text
Get full text
Get full text
Article -
8
Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem
Published 2022“…Production scheduling is a complex combined optimization problem and the optimization method of which is not perfect [1]. …”
Get full text
Get full text
Article -
9
Accelerating graph algorithms with priority queue processor
Published 2006“…DijkstraÂ’s algorithm is chosen as the target implementation, as many state-of-the-art graph algorithms use DijkstraÂ’s algorithm at the heart of their computational engine. …”
Get full text
Get full text
Article -
10
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 -
11
Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing
Published 2007“…Graphs are pervasive data structures in computer science, and algorithms working with them are fundamental to the field. …”
Get full text
Get full text
Get full text
Thesis -
12
Image matching using relational graph representation
Published 2005Get full text
Get full text
Thesis -
13
-
14
-
15
Branch and bound algorithm for finding the maximum clique problem
Published 2018Get full text
Get full text
Conference or Workshop Item -
16
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 -
17
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 -
18
-
19
Optimization of turning parameters using genetic algorithm method
Published 2008“…The simulation based on Genetic Algorithm are successful develop and the optimum parameters values are obtained from the simulation.…”
Get full text
Get full text
Undergraduates Project Papers -
20