Search alternatives:
working algorithms » learning algorithms (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
element » elements (Expand Search)
working algorithms » learning algorithms (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
element » elements (Expand Search)
-
1
Multilayer Reversible Data Hiding Based on the Difference Expansion Method Using Multilevel Thresholding of Host Images Based on the Slime Mould Algorithm
Published 2022“…Researchers have scrutinized data hiding schemes in recent years. Data hiding in standard images works well, but does not provide satisfactory results in distortion-sensitive medical, military, or forensic images. …”
Get full text
-
2
An algorithm for solving bond pricing problem
Published 2002Get full text
Get full text
Get full text
Get full text
article -
3
-
4
A Hash-Based Assessment and Recovery Algorithm for Distributed Healthcare Systems Using Blockchain Technology
Published 2020“…Numerous damage assessment and recovery algorithms have been proposed in the literature. In this work, we present a distributed algorithm that uses blockchain technology and hash tables to solve the information warfare problem in healthcare systems. …”
Get full text
Get full text
Get full text
masterThesis -
5
Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem
Published 2018“…Genetic algorithms were successfully useful to solve many optimization problems including the university Timetable Problem. …”
Get full text
Get full text
Get full text
Get full text
article -
6
Genetic and heuristic algorithms for regrouping service sites. (c2000)
Published 2000Get full text
Get full text
masterThesis -
7
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 -
8
-
9
Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017)
Published 2017Get full text
Get full text
Get full text
masterThesis -
10
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 -
11
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 -
12
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 -
13
Stochastic Search Algorithms for Exam Scheduling
Published 2007“…A good exam schedule should aim to minimize conflicts and the two unfairness factors based on user-assigned weights to these three factors and subject to some constraints such as classrooms’ number and capacities. In this work, we use a modified weighted-graph coloring problem formulation and adapt two stochastic search algorithms for solving the problem. …”
Get full text
Get full text
article -
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
The buffered work-pool approach for search-tree based optimization algorithms
Published 2017“…Recent advances in algorithm design have shown a growing interest in seeking exact solutions to many hard problems. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
16
Parallel implementation of clique partitioning using artificial neural networks. (c2000)
Published 2000Get full text
Get full text
masterThesis -
17
Development of an Optimization Algorithm for Internet Data Traffic
Published 2020“…In this paper, an optimization algorithm is proposed to reduce net data traffic, which works at Internet layer in the TCP/IP reference model. …”
Get full text
article -
18
Social spider optimization algorithm: survey and new applications
Published 2024“…Finally, this chapter provides an expectation of the fields that need to work with this algorithm to improve problem-solving and the fields that have a growing number studies that use this algorithm.…”
Get full text
-
19
-
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. …”