Search Results - (( java simulation optimization algorithm ) OR ( _ optimization max algorithm ))

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”

SG-PBFS : Shortest Gap-Priority Based Fair Scheduling technique for job scheduling in cloud environment by Murad, Saydul Akbar, Zafril Rizal, M. Azmi, Muzahid, Abu Jafar Md, Bhuiyan, Md Khairul Bashar, Saib, Md, Rahimi, Nick, Prottasha, Nusrat Jahan, Bairagi, Anupam Kumar

“…Firstly, a Priority-Based Fair Scheduling (PBFS) algorithm has been introduced to schedule jobs so that jobs can access the required resources at optimal times. …”
Get full text
Get full text
Get full text
Get full text

OTS: an optimal tasks scheduling algorithm based on QoS in cloud computing network by Alhakimi, Mohammed Ameen, Latip, Rohaya

“…This study presents an optimal tasks scheduling algorithm by enhancing Max-Min algorithm. …”
Get full text
Get full text

A particle swarm optimization and min-max­-based workflow scheduling algorithm with QoS satisfaction for service-­oriented grids by Ambursa, Faruku Umar, Latip, Rohaya, Abdullah, Azizol, K. Subramaniam, Shamala

“…It also outperforms the comparison algorithm, with about 30% increase, in terms of cumulative QoS satisfaction of optimization requirements. …”
Get full text
Get full text

Optimal channel assignment for multi-hop wimax mesh networks by Haleem, Ahmed Shain

“…The objective of this study is to guarantee a throughput for individual stream in a multi-hop WiMAX mesh network. We study various scheduling algorithms with respect to the QoS constraints and come up with a framework which would help us to understand the optimal channel assignment and enhance the scheduling in multi-hop WiMAX mesh networks. …”
Get full text
Get full text

A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem by Odili, Julius Beneoluchi, Noraziah, Ahmad, Zarina, M.

“…This paper presents a comparative performance analysis of some metaheuristics such as the African Buffalo Optimization algorithm (ABO), Improved Extremal Optimization (IEO), Model-Induced Max-Min Ant Colony Optimization (MIMM-ACO), Max-Min Ant System (MMAS), Cooperative Genetic Ant System (CGAS), and the heuristic, Randomized Insertion Algorithm (RAI) to solve the asymmetric Travelling Salesman Problem (ATSP). …”
Get full text
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

“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text

Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

“…The exploration versus exploitation dilemma rises in ACO search.Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation.It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary exploration later.This paper examined the assumption that local heuristics are useless when combined with local search especially when it applied for combinatorial optimization problems with rugged fitness landscape.Results showed that coupling reactive heuristics with k-Opt local search algorithms produces higher quality solutions and more robust search than max-min ant system algorithm.Well-known combinatorial optimization problems are used in experiments, i.e. traveling salesman and quadratic assignment problems. …”
Get full text
Get full text
Get full text

A new strategy to improve the search performance of Max-Min Ant Aystem Algorithm when solving the Quadratic Assignment Problems by Phen, Chiak See

Get full text

An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

“…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
Get full text
Get full text
Get full text

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

“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. 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

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text

Fair bandwidth assignment in hierarchical scheduling for mobile WiMAX system by Alsahag, Ali Mohammed Mansoor, Mohd Ali, Borhanuddin, Noordin, Nor Kamariah, Mohamad, Hafizal

“…Simulations result showed that the proposed algorithm optimize the overall system throughput and assigns bandwidth effectively to the different service classes while ensuring that the QoS requirements are satisfied.…”
Get full text
Get full text

An optimal tasks scheduling algorithm based on QoS in cloud computing network by Alhakimi, Mohammed Ameen Mohammed Abdo

“…This study presents an optimal task scheduling algorithm by enhancing Max-Min and TS algorithm. …”
Get full text
Get full text

Reactive max-min ant system with recursive local search and its application to TSP and QAP by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

Get full text
Get full text
Get full text

Revisiting the pheromone evaluation mechanism in the interacted multiple ant colonies optimization framework by Aljanaby A., Ku-Mahamud K.R., Norwawi N.Md.

Subjects:

Performance impact of relay selection in WiMAX IEEE 802.16j multi-hop relay networks by Mazhar, Noman, Zeeshan, Muhammad, Naveed, Anjum

“…Wireless network has many inherent issues like coverage holes; capacity optimization and mobility are few of them. Adding relays to multi-hop WiMAX IEEE 802.16j network present an effective solution to address them to some extent but this amendment does not elaborate any algorithm regarding the relay selection and narrate no performance guarantees. …”
Get full text
Get full text

Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems by Fayaz, Muhammad, Arshad, S, Shah, A.S, Shah, Asadullah

“…Hence, these approaches regularly fail to provide optimal results on specific graph instances. These problems motivated to propose Max Degres Around (MDA) approximation algorithm for the MVC problem. …”
Get full text
Get full text
Get full text

Maximum 2-satisfiability in radial basis function neural network by Shehab Abdulhabib Alzaeemi, Saratha Sathasivam, Mohd Shareduwan Mohd Kasihmuddin, Mohd. Asyraf Mansor

“…Hence, we restrict the analysis to MAX2SAT clauses. We utilize Dev C++ as the platform of training and testing our proposed algorithm. …”
Get full text
Get full text
Get full text

A new minimum pheromone threshold strategy (MPTS) for max-min ant system by Wong, Kuan Yew, See, Phen Chiak

“…Among others is the ant colony optimization (ACO) algorithm, which was inspired by the foraging behavior of ants. …”
Get full text
Get full text