Search alternatives:
processing algorithm » processing algorithms (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
processing algorithm » processing algorithms (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data algorithm » jaya algorithm (Expand Search), deer algorithm (Expand Search)
-
41
A Parallel Genetic Algorithm for the Open-Shop Scheduling Problem Using Deterministic and Random Moves
Published 2016“…This paper investigates the use of parallel genetic algorithms in order to solve the open-shop scheduling problem. …”
Get full text
Get full text
Get full text
article -
42
Portfolio Selection Problem Using CVaR Risk Measures Equipped with DEA, PSO, and ICA Algorithms
Published 2022“…Since the search space is vast in actual markets and there are limitations such as the number of assets and their weight, the optimization problem becomes difficult. Evolutionary algorithms are a powerful tool to deal with these difficulties. …”
-
43
An Evolutionary Algorithm for the Allocation Problem in High-Level Synthesis
Published 2005“…This paper presents an evolutionary algorithm to solve the datapath allocation problem in high-level synthesis. …”
Get full text
Get full text
Get full text
article -
44
Algorithmic Study of Online Multi-Facility Location Problems
Published 2022“…This is known as the Multi-Facility Location problem (MFL) and has been studied in the offline setting, in which the entire input sequence is given to the algorithm at once. …”
Get full text
Get full text
Get full text
Get full text
article -
45
Improved prairie dog optimization algorithm by dwarf mongoose optimization algorithm for optimization problems
Published 2023“…The proposed method is based on enhancing the search process of the Prairie Dog Optimization Algorithm (PDOA) by using the primary updating mechanism of the Dwarf Mongoose Optimization Algorithm (DMOA). …”
Get full text
-
46
A direct algorithm for the parameterized face cover problem
Published 2017Get full text
Get full text
conferenceObject -
47
Correlation Clustering via s-Club Cluster Edge Deletion
Published 2023Subjects: “…Cluster analysis -- Data processing…”
Get full text
Get full text
Get full text
masterThesis -
48
-
49
Improvement of Kernel Principal Component Analysis-Based Approach for Nonlinear Process Monitoring by Data Set Size Reduction Using Class Interval
Published 2024“…In this paper, the proposed algorithm selects relevant observations from the original data set by utilizing a class interval technique (i.e. histogram) to maintain a bunch of representative samples from each bin. …”
-
50
Teaching–learning-based optimization algorithm: analysis study and its application
Published 2024“…The teaching–learning-based optimization (TLBO) algorithm is a novel nature-based optimization approach that has attracted a lot of interest from researchers because of its great capacity to handle optimization problems. …”
Get full text
-
51
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
Get full text
Get full text
article -
52
An evolutionary algorithm for solving the geometrically constrained site layout problem
Published 2017“…The layout problem considered in this paper is a static layout problem characterized by affinity weights used to model transportation costs between facilities and by geometric constraints between relative positions of facilities on site. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
53
A simulated annealing algorithm for the capacitated vehicle routing problem
Published 2017“…In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combination of random and deterministic operators that are based on problem knowledge information. …”
Get full text
Get full text
Get full text
conferenceObject -
54
A Simulated Annealing Algorithm For Fuzzy Unit Commitment Problem
Published 2020“…This paper presents a new algorithm based on integrating simulated annealing and fuzzy logic methods to solve the unit commitment problem. …”
Get full text
article -
55
A simulated annealing algorithm for fuzzy unit commitment problem
Published 1999“…This paper presents a new algorithm based on integrating simulated annealing and fuzzy logic methods to solve the unit commitment problem. …”
Get full text
Get full text
article -
56
A simulated annealing algorithm for the capacitated vehicle routing problem
Published 2011“…In this paper, we present a meta-heuristic approach for solving the CVRP based on simulated annealing. The algorithm uses a combination of random and deterministic operators that are based on problem knowledge information. …”
Get full text
Get full text
Get full text
conferenceObject -
57
Scatter search algorithm for the cross-dock door assignment problem
Published 2014“…A lot of research has been conducted regarding this topic still, up to our knowledge, none used Scatter Search (SS). In this paper, we implemented this evolutionary metaheuristic algorithm and tested it, then compared the results with those of another evolutionary algorithm, Genetic Algorithm (GA). …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
58
Natural optimization algorithms for the cross-dock door assignment problem
Published 2016“…The results indicate that the SS algorithm outperformed the GA, particularly for large-sized problems with a diverse reference set.…”
Get full text
Get full text
Get full text
Get full text
article -
59
Fixed-parameter algorithms for hitting set problems. (c2006)
Published 2006Get full text
Get full text
masterThesis -
60
Optimizing Document Classification: Unleashing the Power of Genetic Algorithms
Published 2023“…Additionally, our proposed model optimizes the features using a genetic algorithm. Optimal feature selection performances a crucial role in this domain, enhancing the overall accuracy of the document classification system while reducing the time complexity associated with selecting the most relevant features from this large-dimensional space. …”