Search alternatives:
models algorithm » mould algorithm (Expand Search), deer algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
based models » based modeling (Expand Search)
element » elements (Expand Search)
models algorithm » mould algorithm (Expand Search), deer algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
based models » based modeling (Expand Search)
element » elements (Expand Search)
-
61
Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines
Published 2017Subjects: “…Model Based Testing…”
Get full text
doctoralThesis -
62
Modified arithmetic optimization algorithm for drones measurements and tracks assignment problem
Published 2023“…The measurements and track generation are simulated using Stone Soup software. On the other hand, the optimization of the problem is implemented using several evolutionary-based metaheuristic algorithms. …”
Get full text
-
63
An Efficient Tabu Search Algorithm For The Single-Machine Mean Tardiness Problem
Published 2020“…In this paper, an efficient tabu search algorithm is prepared ibr solving the singlemachine mean tardiness problem. …”
Get full text
article -
64
A parallel optimization algorithm for the maximum clique problem. (c2008)
Published 2008Get full text
Get full text
masterThesis -
65
A parallel genetic algorithm for the geometrically constrained site layout problem
Published 2018“…This paper presents a parallel genetic algorithm to solve the geometrically constrained site layout problem that involves coordinating the use of limited space to accommodate temporary facilities subject to geometric constraints. …”
Get full text
Get full text
Get full text
conferenceObject -
66
Linear-time algorithms for problems on planar graphs with fixed disk dimension
Published 2007“…In particular, a linear-time approximation algorithm is presented for the pathwidth problem.…”
Get full text
Get full text
Get full text
article -
67
Integrating genetic algorithms, tabu search, and simulatedannealing for the unit commitment problem
Published 1999“…This paper presents a new algorithm based on integrating genetic algorithms, tabu search and simulated annealing methods to solve the unit commitment problem. …”
Get full text
Get full text
article -
68
A Multiswarm Intelligence Algorithm for Expensive Bound Constrained Optimization Problems
Published 2021“…The test suite of benchmark function is recently designed for the special session of EAs competition in IEEE Congress on Evolutionary Computation (IEEE-CEC′13). The suggested algorithm has approximated promising solutions with good convergence and diversity maintenance for most of the used bound constrained single optimization problems. …”
-
69
Efficient convex-elastic net algorithm to solve the Euclideantraveling salesman problem
Published 1998“…This paper describes a hybrid algorithm that combines an adaptive-type neural network algorithm and a nondeterministic iterative algorithm to solve the Euclidean traveling salesman problem (E-TSP). …”
Get full text
Get full text
article -
70
Modified clarke wright algorithms for solving the realistic vehicle routing problem
Published 2015Get full text
Get full text
Get full text
Get full text
conferenceObject -
71
-
72
Multiclass feature selection with metaheuristic optimization algorithms: a review
Published 2022“…Datasets can be classified using various methods. Nevertheless, metaheuristic algorithms attract substantial attention to solving different problems in optimization. …”
Get full text
-
73
Physical optimization algorithms for mapping data to distributed-memory multiprocessors
Published 1992“…PGA has excellent speed-ups by virtue of the natural evolution model on which it is based. PSA and PNN include communication schemes adapted to the properties of the mapping problem and of the algorithms themselves for reducing the communication overhead. …”
Get full text
Get full text
Get full text
masterThesis -
74
A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units
Published 2020“…The algorithm was developed, implemented and tested on an integrated model for the MS problem. …”
Get full text
article -
75
A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units
Published 2020“…The algorithm was developed, implemented and tested on an integrated model for the MS problem. …”
Get full text
article -
76
Eye-Clustering: An Enhanced Centroids Prediction for K-means Algorithm
Published 2024“…Various clustering methods are available, including K-means, hierarchical clustering, and density-based clustering. Among these, K-means is widely used for efficiently solving clustering problems. …”
Get full text
Get full text
Get full text
masterThesis -
77
-
78
Efficient methods and techniques for the open-shop scheduling problem. (c2006)
Published 2006Get full text
Get full text
masterThesis -
79
Modeling and Control of a Robot Based Rehabilitation System for the Head-Neck Joint
Published 2024Get full text
doctoralThesis -
80