Search Results - (( problem using max algorithm ) OR ( java application testing algorithm ))

Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

“…Many algorithms have been implemented to solve the grid scheduling problem. …”
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

“…Ant colony optimization (ACO) is a stochastic search method for solving NP-hard problems. 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

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

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

RSA Encryption & Decryption using JAVA by Ramli, Marliyana

“…The implementation of this project will be based on Rapid Application Design Methodology (RAD) and will be more focusing on research and finding, ideas and the implementation of the algorithm, and finally running and testing the algorithm. …”
Get full text
Get full text

Modern fuzzy min max neural networks for pattern classification by Al Sayaydeh, Osama Nayel Ahmad

“…To build an efficient classifier model, researchers have introduced hybrid models that combine both fuzzy logic and artificial neural networks. Among these algorithms, Fuzzy Min Max (FMM) neural network algorithm has been proven to be one of the premier neural networks for undertaking the pattern classification problems. …”
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

“…Thereafter, various suggestions have been made to improve the performance of the ACO algorithm. One of them is through the development of the max–min ant system (MMAS) algorithm. …”
Get full text
Get full text

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

“…We introduced two new approaches to normalization techniques to enhance the K-Means algorithms. This is to remedy the problem of using the existing Min-Max (MM) and Decimal Scaling (DS) techniques, which have overflow weakness. …”
Get full text
Get full text
Get full text

A modified fuzzy min-max neural network with a genetic-algorithm-based rule extractor for pattern classification by Quteishat, A., Lim, C.P., Tan, K.S.

“…The first stage consists of a modified fuzzy min-max (FMM) neural-network-based pattern classifier, while the second stage consists of a genetic-algorithm (GA)-based rule extractor. …”
Get full text

Quality of service management algorithms in WiMAX networks by Saidu, Ibrahim

“…Simulation have been extensively used to evaluate the proposed algorithm. Finally, Discrete Event Simulator (DES) is designed and developed in order to evaluate the performance of the proposed algorithms. …”
Get full text
Get full text

Interacted Multiple Ant Colonies for Search Stagnation Problem by Aljanabi, Alaa Ismael

“…This thesis addresses the issues associated with search stagnation problem that ACO algorithms suffer from. In particular, it proposes the use of multiple interacted ant colonies as a new algorithmic framework. …”
Get full text
Get full text
Get full text

The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood... by Jeeu, Fong Sze, Said, Salhi, Niaz, A. Wassan

“…While the literature for the CCVRP is scarce, this problem has useful applications especially in the area of supplying humanitarian aid after a natural disaster. …”
Get full text
Get full text
Get full text

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. The objectives of this work are: i) to provide a comprehensive review of the cloud and scheduling process; ii) to classify the scheduling strategies and scientific workflows; iii) to implement our proposed algorithm with various scheduling algorithms (i.e., Min-Min, Round-Robin, Max-Min, and Modified Max-Min) for performance comparison, within different cloudlet sizes (i.e., small, medium, large, and heavy) in three scientific workflows (i.e., Montage, Epigenomics, and SIPHT); and iv) to investigate the performance of the implemented algorithms by using CloudSim. …”

Comparison of Search Algorithms in Javanese-Indonesian Dictionary Application by Yana Aditia, Gerhana, Nur, Lukman, Arief Fatchul, Huda, Cecep Nurul, Alam, Undang, Syaripudin, Devi, Novitasari

“…Performance Testing is used to test the performance of algorithm implementations in applications. …”
Get full text
Get full text

An exploration technique for the interacted multiple ant colonies optimization framework by Aljanaby A., Ku-Mahamud K.R., Norwawi N.Md.

Two-dimensional burst construction with QoS assurance for OFDMA mobile WiMAX system by Alsahag, Ali Mohammed Mansoor, Mohd Ali, Borhanuddin, Noordin, Nor Kamariah, Mohamad, Hafizal, Ramli, Nordin

Get full text
Get full text

Performance comparison of differential evolution and particle swarm optimization in constrained optimization by Iwan, Mahmud, Akmeliawati, Rini, Faisal, Tarig, Al-Assadi, Hayder M.A.A.

“…Particle swarm optimization (PSO) and differential evolution (DE) are among the well-known modern optimization algorithms. This paper presents a comparative study for min-max constrained optimization using PSO and DE. …”
Get full text
Get full text
Get full text

Reactive approach for automating exploration and exploitation in ant colony optimization by Allwawi, Rafid Sagban Abbood

“…Ant colony optimization (ACO) algorithms can be used to solve nondeterministic polynomial hard problems. …”
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