Search Results - (( java implication based algorithm ) OR ( problem presentation connection algorithm ))
Search alternatives:
- presentation connection »
- problem presentation »
- connection algorithm »
- implication based »
- java implication »
-
1
Routing problem in rectangular mesh network using Dijkstra’s based Greedy method
Published 2018“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra’s algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
2
Routing problem in rectangular mesh network using shortest path based Greedy method
Published 2019“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
3
Routing problem in rectangular mesh network using shortest path based Greedy method
Published 2019“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text
Conference or Workshop Item -
4
Profit-based optimal generation scheduling of a microgrid
Published 2023“…A case study on the difference between grid-connected and islanded operation is presented. The results demonstrate the efficiency of using genetic algorithm to solve the optimization problem. �2010 IEEE.…”
Conference paper -
5
An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network
Published 2017“…In this paper, we present a routing algorithm based on enhanced simulated annealing technique to provide the connection between nodes in a semi-diagonal torus (SD-Torus) network. …”
Get full text
Get full text
Get full text
Article -
6
Quantum Processing Framework And Hybrid Algorithms For Routing Problems
Published 2010“…Moreover, a quantum algorithm was designed to solve the shortest paths problem between the two points in a network. …”
Get full text
Get full text
Thesis -
7
Implication of image processing algorithm in remote sensing and GIS applications
Published 2011“…An algorithm solves the complex problems more efficiently and consistently. …”
Get full text
Get full text
Get full text
Article -
8
Hybrid Harris Hawks with Sine Cosine for Optimal Node Placement and Congestion Reduction in an Industrial Wireless Mesh Network
Published 2023“…Consequently, a novel hybrid Harris Hawks optimization with the sine cosine algorithm (HHOSCA) is presented in this work to tackle the aforementioned WMN optimization problems. …”
Get full text
Get full text
Article -
9
Density based subspace clustering: a case study on perception of the required skill
Published 2014“…In the early stage, the present research estimates density dimensions and the results are used as input data to determine the initial cluster based on density connection, using DBSCAN algorithm. …”
Get full text
Get full text
Thesis -
10
Density subspace clustering: a case study on perception of the required skill
Published 2014“…In the early stage, the present research estimates density dimensions and the results are used as input data to determine the initial cluster based on density connection, using DBSCAN algorithm. …”
Get full text
Get full text
Thesis -
11
Nomadic people optimizer for IoT combinatorial testing problem
Published 2021Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
12
Scheduling algorithm for multiuser diversity in urban area / Hamizah Mohd Mahayudin
Published 2015“…Hence, analysis of the wireless connection attribute such as fairness, throughput and delay occur during users demanding for different services are presented. …”
Get full text
Get full text
Thesis -
13
-
14
Joint optimization of resources allocation for quality of service aware next-generation heterogeneous cellular networks / Hayder Faeq Rasool Alhashimi
Published 2025“…Then, an auction algorithm is proposed to solve the channel assignment optimization problem to maximize the spectrum efficiency (SE). …”
Get full text
Get full text
Get full text
Thesis -
15
-
16
Neighbour-based on-demand routing algorithms for mobile ad hoc networks
Published 2017“…Furthermore, the third algorithm NDAR presents further enhancement and better performance in all five performance metrics as compared to NCPR and AODV algorithms in a low or high density of nodes. …”
Get full text
Get full text
Get full text
Thesis -
17
LOCALIZED MOVEMENT CONTROL CONNECTIVITY RESTORATION ALGORITHMS FOR WIRELESS SENSOR AND ACTOR NETWORKS
Published 2011“…In this dissertation, we address the challenging connectivity restoration problem while maintaining minimal network state information. …”
Get full text
Get full text
Thesis -
18
Coverage and connectivity maximization for wireless sensor networks using improved chaotic grey wolf optimization
Published 2025“…A mathematical model for the WSN coverage and connectivity optimization problem is developed as the foundation. …”
Get full text
Get full text
Get full text
Article -
19
Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences
Published 2024journal::journal article -
20
Numerical experiment on conformal mapping of doubly connected regions onto a disk with a slit
Published 2009“…We present a method for computing the conformal mapping function of doubly connected regions bounded by two closed Jordan curves onto a disk with a concentric circular slit of radius . …”
Get full text
Article
