Results 161 to 170 of about 2,306,141 (191)
Some of the next articles are maybe not open access.

Dragonfly algorithm: a comprehensive survey of its results, variants, and applications

Multimedia Tools and Applications, 2021
This paper thoroughly introduces a comprehensive review of the so-called Dragonfly algorithm (DA) and highlights its main characteristics. DA is considered one of the promising swarm optimization algorithms because it successfully applied in a wide range of optimization problems in several fields, such as engineering design, medical applications, image
Mohammad Alshinwan   +6 more
openaire   +1 more source

A Dragonfly Algorithm for Solving Traveling Salesman Problem

2018 8th IEEE International Conference on Control System, Computing and Engineering (ICCSCE), 2018
Traveling Salesman Problem (TSP) is considered as nondeterministic polynomial time hard problem. In the TSP, a salesman should visit a set of cities, and the distances between all pairs of cities are known in advance. The salesman has to find the shortest tour for visiting all cities exactly once and returns back to the starting city.
Abdelaziz I. Hammouri   +5 more
openaire   +1 more source

AMLR: An Adaptive Multi-Level Routing Algorithm for Dragonfly Network

IEEE Communications Letters, 2021
High-radix hierarchical structures, such as the dragonfly, fat-tree, and torus, are cost-effective topologies for high-performance computer (HPC) networks. In these networks, dragonfly outperforms traditional topologies such as fat-tree and torus in cost and scalability.
Lijing Zhu   +3 more
openaire   +1 more source

Unique Dragonfly Optimization Algorithm for Harvesting and Clustering the Key Features

2019 IEEE 18th International Conference on Cognitive Informatics & Cognitive Computing (ICCI*CC), 2019
In many applications, the feature selection plays an important role, as best feature can bring out the accurate results. The features selected must represent the entire dataset. Here we have considered “Sequential Forward Selection” for feature extraction and used refined dragonfly algorithm to approach and to migrate from the best and worst features ...
Nagaraju Devarakonda   +3 more
openaire   +2 more sources

Dragonfly Algorithm for solving probabilistic Economic Load Dispatch problems

Neural Computing and Applications, 2019
Economic Load Dispatch problem in power system is solved by different methods to run the generating station in an economic way for different loading conditions. A combination of thermal power plant and renewable plant of wind and solar photovoltaic is considered for optimal solution at minimal cost using Dragonfly Algorithm.
Diptanu Das   +2 more
openaire   +1 more source

QVal: A Novel Routing Algorithm for Dragonfly Networks

2023 IEEE International Conference on High Performance Computing & Communications, Data Science & Systems, Smart City & Dependability in Sensor, Cloud & Big Data Systems & Application (HPCC/DSS/SmartCity/DependSys), 2023
Javier Navaridas, Jose Antonio Pascual
openaire   +2 more sources

Optimized MPI collective algorithms for dragonfly topology

Proceedings of the 36th ACM International Conference on Supercomputing, 2022
Guangnan Feng, Dezun Dong, Yutong Lu
openaire   +1 more source

Parameter Optimization of Support Vector Machine Using Dragonfly Algorithm

2017
Support Vector Machine (SVM) parameters such as penalty and kernel parameters have a great influence on the complexity and accuracy of the classification model. In this paper, Dragonfly algorithm (DA) has been proposed to optimize the parameters of SVM; thus, the classification error can be decreased.
Alaa Tharwat   +2 more
openaire   +2 more sources

QoS Multicast Routing Based on a Quantum Chaotic Dragonfly Algorithm

2018
Optimizing the quality of service in a multicast routing is a persistent research problem for data transmission in computer networks. It is known to be an NP-hard problem, so several meta-heuristics are applied for an approximate resolution. In this paper, we resolve the quality of service multicast routing problem (QoSMRP) with using a combined ...
Mohammed Mahseur   +2 more
openaire   +1 more source

Solving 0–1 Knapsack Problems by Binary Dragonfly Algorithm

2017
The 0–1 knapsack problem (0–1KP) is a well-known combinatorial optimization problem. It is an NP-hard problem which plays significant roles in many real life applications. Dragonfly algorithm (DA) a novel swarm intelligence optimization algorithm, inspired by the nature of static and dynamic swarming behaviors of dragonflies.
Mohamed Abdel-Basset   +3 more
openaire   +1 more source

Home - About - Disclaimer - Privacy