Search alternatives:
method algorithm » mould algorithm (Expand Search)
mold algorithm » mould algorithm (Expand Search), rd algorithm (Expand Search), colony algorithm (Expand Search)
over algorithm » deer algorithm (Expand Search)
method algorithm » mould algorithm (Expand Search)
mold algorithm » mould algorithm (Expand Search), rd algorithm (Expand Search), colony algorithm (Expand Search)
over algorithm » deer algorithm (Expand Search)
-
21
Design of adaptive arrays based on element position perturbations
Published 1993“…The main advantage of using this technique over the other commonly used methods is that the amplitudes and phases of the array elements can be used mainly to steer the main beam towards the desired signal. …”
Get full text
Get full text
article -
22
-
23
-
24
The Use of Microwave Tomography in Bone Healing Monitoring
Published 2019Get full text
doctoralThesis -
25
Topics in graph algorithms
Published 2003“…This is a notable improvement over the previous best known algorithm, which runs in O(8kn). …”
Get full text
Get full text
Get full text
masterThesis -
26
-
27
-
28
A depth-controlled and energy-efficient routing protocol for underwater wireless sensor networks
Published 2022“…The proposed energy-efficient routing protocol is based on an enhanced genetic algorithm and data fusion technique. In the proposed energy-efficient routing protocol, an existing genetic algorithm is enhanced by adding an encoding strategy, a crossover procedure, and an improved mutation operation that helps determine the nodes. …”
-
29
Dynamic adaptation for video streaming over mobile devices. (c2013)
Published 2013Get full text
Get full text
masterThesis -
30
-
31
Bee Colony Algorithm for Proctors Assignment.
Published 2015“…We apply the Bee Colony algorithm to previously published data. Experimental results show good solutions that maximize the preferences of proctors while preserving the fairness of the workload given to proctors. …”
Get full text
Get full text
Get full text
article -
32
Multi-Cluster Jumping Particle Swarm Optimization for Fast Convergence
Published 2020“…Keeping in view the need of an optimization algorithm with fast convergence speed, suitable for high dimensional data space, this article proposes a novel concept of Multi-Cluster Jumping PSO. …”
-
33
-
34
A kernelization algorithm for d-Hitting Set
Published 2010“…For 3-Hitting Set, an arbitrary instance is reduced into an equivalent one that contains at most 5k2+k elements. This kernelization is an improvement over previously known methods that guarantee cubic-order kernels. …”
Get full text
Get full text
Get full text
article -
35
Scatter Search algorithm for Protein Structure Prediction
Published 2016“…These candidates undergo evolutionary operations that combine search intensification and diversification over a number of iterations. We evaluate our algorithm on three proteins taken from a Protein Data Bank (PDB). …”
Get full text
Get full text
Get full text
article -
36
-
37
Block constrained pressure residual preconditioning for two-phase flow in porous media by mixed hybrid finite elements
Published 2023“…<p dir="ltr">This work proposes an original preconditioner that couples the Constrained Pressure Residual (CPR) method with block preconditioning for the efficient solution of the linearized systems of equations arising from fully implicit multiphase flow models. …”
-
38
A FAMILY OF NORMALIZED LEAST MEAN FOURTH ALGORITHMS
Published 2020“…In this work, a family of normalized least mean fourth algorithms is presented. Unlike the LMF algorithm, the convergence behavior of these algorithms is independent of the input data correlation statistics. …”
Get full text
article -
39
Intelligent Rapidly-Exploring Random Tree Star Algorithm
Published 2024Get full text
doctoralThesis -
40
(k, l)-Clustering for Transactional Data Streams Anonymization
Published 2018“…In this paper, we address the correlation problem in the anonymization of transactional data streams. We propose a bucketization-based technique, entitled (k, l)-clustering to prevent such privacy breaches by ensuring that the same k individuals remain grouped together over the entire anonymized stream. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject