Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
a scheduling » task scheduling (Expand Search), ahead scheduling (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
a scheduling » task scheduling (Expand Search), ahead scheduling (Expand Search)
-
61
An incremental approach for test scheduling and synthesis using genetic algorithms
Published 2017“…This paper presents a new and an efficient method for concurrent BIST synthesis and test scheduling. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
62
Methods for system-on-chip test design, scheduling and optimization. (c2006)
Published 2006Get full text
Get full text
masterThesis -
63
A new simulated annealing-based tabu search algorithm for unitcommitment
Published 1997“…We propose a new hybrid algorithm for solving the unit commitment problem (UCP). …”
Get full text
Get full text
article -
64
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. …”
-
65
A kernelization algorithm for d-Hitting Set
Published 2010“…Our method is used also to obtain quadratic kernels for several other problems. …”
Get full text
Get full text
Get full text
article -
66
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 -
67
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 -
68
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
-
69
A direct algorithm for the parameterized face cover problem
Published 2017Get full text
Get full text
conferenceObject -
70
Incremental & classical genetic algorithm. (c2001)
Published 2001Get full text
Get full text
masterThesis -
71
Optimal Management of Mobile Energy Generation and Storage Systems
Published 2018Get full text
doctoralThesis -
72
-
73
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
-
74
A fast exact sequential algorithm for the partial digest problem
Published 2016“…Two types of simulated data, random and Zhang, are used to measure the efficiency of the algorithm. …”
-
75
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 -
76
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 -
77
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 -
78
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 -
79
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 -
80
Fixed-parameter algorithms for hitting set problems. (c2006)
Published 2006Get full text
Get full text
masterThesis