Search Results - (( simulation permutation parallel algorithm ) OR ( java swarm optimization algorithm ))

Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

“…The parallel simulated annealing algorithm is also developed and it reduces 64% of the time compared to sequential simulated annealing.…”
Get full text
Get full text

Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

“…Enhance hybrid genetic algorithm and particle Swarm optimization are developed to select the optimal device in either fog or cloud. …”
Get full text
Get full text

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text

Bitwise-based Routing Algorithms in Optical Multistage Interconnection Network by Abed, Farzaneh

“…To avoid crosstalk in OMINs many algorithms have been proposed by many researchers such as the Four Heuristic, Simulated Annealing, Genetic, Remove Last Passes and Zero Algorithms. …”
Get full text
Get full text

Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text

Zero Algorithms for Avoiding Crosstalk in Optical Multistage Interconnection Network by Ali Al-Shabi, Mohammed Abdulhameed

“…This routing problem is an NP-hard problem. Many heuristic algorithms have been proposed and designed to perform the routing such as the sequential algorithm, the sequential down algorithm, the degree-ascending algorithm, the degree-descending algorithm, the Simulated Annealing algorithm and the Ant Colony algorithm. …”
Get full text
Get full text

A Simulated Annealing-Based Hyper-Heuristic For The Flexible Job Shop Scheduling Problem by Kelvin, Lim Ching Wei

“…Given a wide range of MAR-JSR permutations, selecting a suitable MAR-JSR pair for a FJSP becomes a challenge. …”
Get full text
Get full text

An ensemble learning method for spam email detection system based on metaheuristic algorithms by Behjat, Amir Rajabi

“…In order to address the challenges that mentioned above in this study, in the first phase, a novel architecture based on ensemble feature selection techniques include Modified Binary Bat Algorithm (NBBA), Binary Quantum Particle Swarm Optimization (QBPSO) Algorithm and Binary Quantum Gravita tional Search Algorithm (QBGSA) is hybridized with the Multi-layer Perceptron (MLP) classifier in order to select relevant feature subsets and improve classification accuracy. …”
Get full text
Get full text