Search Results - (( using function methods algorithm ) OR ( _ optimization max algorithm ))

Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm by Dalatu, Paul Inuwa

“…The K-Means algorithm is the commonest and fast technique in partitional cluster algorithms, although with unnormalized datasets it can achieve local optimal. …”
Get full text
Get full text
Get full text

Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network by Ismail Abdullah, Kalid Abdlkader Marsal

Metaheuristic optimization techniques for localization in outdoor wireless sensor networks: a comprehensive review by Gumaida, Bassam, Ibrahim, Adamu Abubakar

“…This paper serves as a comprehensive background on localization algorithms and methods used in wireless sensor networks, offering insights for researchers to develop efficient localization algorithms tailored to specific application requirements in diverse work environments.…”
Get full text
Get full text
Get full text
Get full text

A quantum-inspired particle swarm optimization approach for environmental/economic power dispatch problem using cubic criterion function by Mahdi, F.P., Vasant, P., Abdullah-Al-Wadud, M., Watada, J., Kallimani, V.

“…Many-objective EED problems are defined by using a cubic criterion function, and a max/max price penalty factor is considered to convert all the objectives into a single objective to compare the final results with other well-known methods found in the literature like Lagrangian relaxation, particle swarm optimization, simulated annealing, and quantum-behaved bat algorithm. …”
Get full text
Get full text

A quantum-inspired particle swarm optimization approach for environmental/economic power dispatch problem using cubic criterion function by Mahdi, F.P., Vasant, P., Abdullah-Al-Wadud, M., Watada, J., Kallimani, V.

“…Many-objective EED problems are defined by using a cubic criterion function, and a max/max price penalty factor is considered to convert all the objectives into a single objective to compare the final results with other well-known methods found in the literature like Lagrangian relaxation, particle swarm optimization, simulated annealing, and quantum-behaved bat algorithm. …”
Get full text
Get full text

Improving neural networks training using experiment design approach by Chong, Wei Kean

“…There are several methods of selecting training data from input space for neural networks which include D-optimal and Max-min design approaches. …”
Get full text
Get full text

Design Optimization of a Gas Turbine Engine for Marine Applications: Off-Design Performance and Control System Considerations by Machmudah, A., Lemma, T.A., Solihin, M.I., Feriadi, Y., Rajabi, A., Afandi, M.I., Abbasi, A.

“…Meta-heuristic optimizations, namely a genetic algorithm (GA) and a whale optimization algorithm (WOA), are applied to optimize the designed control system. …”
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

Fractal coding of bio-metric image for face authentication by Ahadullah, Md

“…This thesis implements the algorithms for the Methods of CPM, BPBM fractal coding, and its application. …”
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

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

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