Search alternatives:
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data control » case control (Expand Search)
element » elements (Expand Search)
method algorithm » mould algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
data control » case control (Expand Search)
element » elements (Expand Search)
-
1
Web Based Online Hybrid Teaching Method of Network Music Course
Published 2022“…In the context of big data, the lengthy personalized screening process of users has become one of the problems to be solved. Based on Web data mining, an improved algorithm of hybrid hierarchical recommendation algorithm and genetic algorithm is used in the experiment, and compared with the other two algorithms in the experiment. …”
Get full text
-
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
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 -
5
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 -
6
Efficient Dynamic Cost Scheduling Algorithm for Data Batch Processing
Published 2016Get full text
doctoralThesis -
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
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 -
12
Robust Control Of Sampled Data Systems
Published 2020“…The authors present robust stability bounds for sampled data systems. The bounds are derived for the general case of additive perturbation in a system, and the control gain matrices for continuous time systems under discrete state feedback control. …”
Get full text
article -
13
Robust control of sampled data systems
Published 1998“…The authors present robust stability bounds for sampled data systems. The bounds are derived for the general case of additive perturbation in a system, and the control gain matrices for continuous time systems under discrete state feedback control. …”
Get full text
Get full text
article -
14
Robust Control Of Sampled Data Systems
Published 2020“…The authors present robust stability bounds for sampled data systems. The bounds are derived for the general case of additive perturbation in a system, and the control gain matrices for continuous time systems under discrete state feedback control. …”
Get full text
article -
15
Robust Control Of Sampled Data Systems
Published 2020“…The authors present robust stability bounds for sampled data systems. The bounds are derived for the general case of additive perturbation in a system, and the control gain matrices for continuous time systems under discrete state feedback control. …”
Get full text
article -
16
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
-
17
Data damage assessment and recovery algorithm from malicious attacks in healthcare data sharing systems
Published 2016“…In a data sharing system in a cloud computing environment, such as health care system, peers or data sources execute transactions on-the-fly in response to user queries without any centralized control. …”
Get full text
Get full text
Get full text
Get full text
article -
18
A depth-controlled and energy-efficient routing protocol for underwater wireless sensor networks
Published 2022Subjects: -
19
Variable Selection in Data Analysis: A Synthetic Data Toolkit
Published 2024“…Variable (feature) selection plays an important role in data analysis and mathematical modeling. This paper aims to address the significant lack of formal evaluation benchmarks for feature selection algorithms (FSAs). …”
Get full text
article -
20