Search alternatives:
method algorithm » mould algorithm (Expand Search)
multi algorithm » mould algorithm (Expand Search), auction algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
element » elements (Expand Search)
method algorithm » mould algorithm (Expand Search)
multi algorithm » mould algorithm (Expand Search), auction algorithm (Expand Search)
using algorithm » cosine algorithm (Expand Search)
element » elements (Expand Search)
-
101
A high-performance toolkit for fast exact algorithms
Published 2017Get full text
Get full text
Get full text
conferenceObject -
102
An Algorithm For Computing The Distance Between Two Circular Disks
Published 2020“…A Kurush-Kuhn-Tucker (KKT) approach is used to solve the problem. We show that when the optimal points are not both at the borders of disks, the solutions of the KKT equations can be obtained in closed-form. …”
Get full text
article -
103
A direct algorithm for the parameterized face cover problem
Published 2017Get full text
Get full text
conferenceObject -
104
Belief selection in point-based planning algorithms for POMDPs
Published 2017Get full text
Get full text
Get full text
Get full text
conferenceObject -
105
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
-
106
Multi-Classifier Tree With Transient Features for Drift Compensation in Electronic Nose
Published 2020“…In this paper, these two problems of `sensors long term drift' and `delayed response' are solved simultaneously to propose a robust and fast electronic nose system, with following merits: (i) only initial transient state features are used in the proposed system without waiting for the sensors to reach a steady state, (ii) a modified boxplot approach is used to handle noisy/drifted data points as a preprocessing step before the classification setup, (iii) a heuristic tree classification approach with optimized transient features is proposed, (iv) the proposed approach only relies on adapted ML methods contrary to the traditional approaches like system recalibration or sensors replacement for handling sensors drift, and (v) the proposed ML model does not require any target domain data and uses only the source domain data for learning the classifier, opposed to the other ML solutions available in the existing literature. …”
-
107
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. …”
-
108
Genetic Algorithm Based Simultaneous Eigenvalue Placement Of Power Systems
Published 2020“…This paper demonstrates the use of genetic algorithms to design a single output feedback control law for the simultaneous eigenvalue placement of a power system running over a wide range of operating conditions. …”
Get full text
article -
109
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 -
110
A Simulated Annealing Algorithm For Fuzzy Unit Commitment Problem
Published 2020“…This paper presents a new algorithm based on integrating simulated annealing and fuzzy logic methods to solve the unit commitment problem. …”
Get full text
article -
111
A simulated annealing algorithm for fuzzy unit commitment problem
Published 1999“…This paper presents a new algorithm based on integrating simulated annealing and fuzzy logic methods to solve the unit commitment problem. …”
Get full text
Get full text
article -
112
A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units
Published 2020“…The performance of the Tabu search algorithm is promising. The Tabu search algorithm solved two power system problems, 4 units and 22 units. …”
Get full text
article -
113
A Tabu Search Algorithm For Maintenance Scheduling Of Generating Units
Published 2020“…The performance of the Tabu search algorithm is promising. The Tabu search algorithm solved two power system problems, 4 units and 22 units. …”
Get full text
article -
114
Synthesis of MVL Functions - Part I: The Genetic Algorithm Approach
Published 2006“…Multiple-Valued Logic (MVL) has been used in the design of a number of logic systems, including memory, multi-level data communication coding, and a number of special purpose digital processors. …”
Get full text
Get full text
article -
115
Simulated annealing and genetic algorithms for exam scheduling. (c1997)
Published 1997Get full text
Get full text
masterThesis -
116
Genetic and heuristic algorithms for regrouping service sites. (c2000)
Published 2000Get full text
Get full text
masterThesis -
117
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
-
118
A New Penalty Function Algorithm For Convex Quadratic Programming
Published 2020“…In this paper, we develop an exterior point algorithm for convex quadratic programming using a penalty function approach. …”
Get full text
article -
119
A Parallel Neural Networks Algorithm for the Clique Partitioning Problem
Published 2002“…In this paper we present a parallel algorithm to solve the above problem for arbitrary graphs using a Hopfield Neural Network model of computation. …”
Get full text
Get full text
article -
120
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. …”