Search Results - (( problem using max algorithm ) OR ( java implementation case algorithm ))
Search alternatives:
- java implementation »
- implementation case »
- case algorithm »
- max algorithm »
- using max »
-
1
OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT
Published 2023“…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. …”
Review -
2
Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm
Published 2008“…The prototype system, known as Java Plagiarism Detection System (JPDS) implements the Greedy-String-Tiling algorithm to detect similarities among tokens in a Java source code files. …”
Get full text
Get full text
Get full text
Thesis -
3
Batch mode heuristic approaches for efficient task scheduling in grid computing system
Published 2016“…Many algorithms have been implemented to solve the grid scheduling problem. …”
Get full text
Get full text
Get full text
Thesis -
4
Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches
Published 2015“…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
Conference or Workshop Item -
5
-
6
A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem
Published 2021“…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
Article -
7
-
8
An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem
Published 2021“…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
Article -
9
Modern fuzzy min max neural networks for pattern classification
Published 2019“…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
Thesis -
10
A new minimum pheromone threshold strategy (MPTS) for max-min ant system
Published 2009“…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
Article -
11
Pairwise testing tools based on hill climbing algorithm (PTCA)
Published 2014“…The actual implementation of the algorithm which is in Java programming language, the program is implemented on Net Bean 7.0.1. …”
Get full text
Get full text
Undergraduates Project Papers -
12
Statistical data preprocessing methods in distance functions to enhance k-means clustering algorithm
Published 2018“…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
Thesis -
13
Examination timetabling using genetic algorithm case study: KUiTTHO
Published 2005Get full text
Get full text
Thesis -
14
A modified fuzzy min-max neural network with a genetic-algorithm-based rule extractor for pattern classification
Published 2010“…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
Article -
15
Java based expert system for selection of natural fibre composite materials
Published 2013“…In this paper, we develop a technology for the materials selection system using Java based expert system. The weighted-range method (WRM) was implemented to identify the range value and to scrutinise the candidate materials. …”
Get full text
Get full text
Get full text
Article -
16
Quality of service management algorithms in WiMAX networks
Published 2015“…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
Thesis -
17
-
18
Interacted Multiple Ant Colonies for Search Stagnation Problem
Published 2010“…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
Thesis -
19
The cumulative capacitated vehicle routing problem with min-sum and min-max objectives: An effective hybridisation of adaptive variable neighbourhood search and large neighbourhood...
Published 2017“…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
Article -
20
An exploration technique for the interacted multiple ant colonies optimization framework
Published 2024Conference Paper
