Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
finding » findings (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
finding » findings (Expand Search)
-
1
Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem
Published 2018“…There are many algorithms and approaches adopted to solve this problem, but one of the effective approaches to solve it is the use of meta-heuristics. …”
Get full text
Get full text
Get full text
Get full text
article -
2
Multilayer Reversible Data Hiding Based on the Difference Expansion Method Using Multilevel Thresholding of Host Images Based on the Slime Mould Algorithm
Published 2022“…Optimization algorithms are one of the most popular methods for solving NP-hard problems. …”
Get full text
-
3
An algorithm for solving bond pricing problem
Published 2002Get full text
Get full text
Get full text
Get full text
article -
4
A comparative study of RSA based digital signature algorithms
Published 2006“…After factorization is found, the RSA problem could be solved by finding the private key using the extended Euclidean algorithm.…”
Get full text
Get full text
Get full text
Get full text
article -
5
A new simulated annealing-based tabu search algorithm for unitcommitment
Published 1997“…The algorithm integrates the use of simulated annealing (SA) and tabu search (TS) for solving the UCP. …”
Get full text
Get full text
article -
6
An evolutionary algorithm for solving the geometrically constrained site layout problem
Published 2017“…This paper presents an investigation of applying an evolutionary approach to optimally solve the aforementioned layout problem. The proposed algorithm is two-phases: an initialization phase that generates an initial population of layouts through a sequence of mutation operations, and a reproduction phase that evolve the layouts generated in phase one through a sequence of genetic operations aiming at finding an optimal layout. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
7
-
8
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 -
9
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 -
10
Genetic Algorithm for Solving Site Layout Problem with Unequal-Size and Constrained Facilities
Published 2002“…This paper presents an investigation of the applicability of a genetic approach for solving the construction site layout problem. This problem involves coordinating the use of limited site space to accommodate temporary facilities so that transportation cost of materials is minimized. …”
Get full text
Get full text
Get full text
article -
11
-
12
Natural optimization algorithms for optimal regression testing
Published 1997“…The algorithms are based on an integer programming problem formulation and the program's control-flow graph. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
13
Intelligent Rapidly-Exploring Random Tree Star Algorithm
Published 2024Get full text
doctoralThesis -
14
A reduced model for phase-change problems with radiation using simplified PN approximations
Published 2025“…The integro-differential equation for the full radiative transfer is replaced by a set of differential equations which are independent of the angle variable and easy to solve using conventional computational methods. To solve the coupled equations, we implement a second-order implicit scheme for the time integration and a mixed finite element method for the space discretization. …”
Get full text
article -
15
A direct algorithm for the parameterized face cover problem
Published 2017“…Recent improvements to face cover algorithms are based on the theory of fixed-parameter tractability and reductions to planar dominating set. …”
Get full text
Get full text
conferenceObject -
16
Social spider optimization algorithm: survey and new applications
Published 2024“…This survey studied the SSO and compared it with other PSO algorithms to find the best-performing algorithm based on a benchmark. …”
Get full text
-
17
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
-
18
A Scatter search algorithm for exam scheduling. (c2006)
Published 2006Get full text
Get full text
masterThesis -
19
Genetic and heuristic algorithms for regrouping service sites. (c2000)
Published 2000Get full text
Get full text
masterThesis -
20
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. …”