Search alternatives:
new functional » _ functional (Expand Search), bio functional (Expand Search)
algorithm new » algorithm novel (Expand Search), algorithm _ (Expand Search), algorithm fa (Expand Search)
algorithm fc » algorithm fa (Expand Search), algorithm _ (Expand Search), algorithm a (Expand Search)
new functional » _ functional (Expand Search), bio functional (Expand Search)
algorithm new » algorithm novel (Expand Search), algorithm _ (Expand Search), algorithm fa (Expand Search)
algorithm fc » algorithm fa (Expand Search), algorithm _ (Expand Search), algorithm a (Expand Search)
-
1
New enumeration algorithm for regular boolean functions
Published 2018“…This paper introduces a new algorithm for enumerating regular Boolean functions. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
2
A New Penalty Function Algorithm For Convex Quadratic Programming
Published 2020Get full text
article -
3
Salp swarm algorithm: survey, analysis, and new applications
Published 2024“…This chapter offers the sea salmon-associated polyp (SALP) swarm algorithm (SSA) and multipurpose SSA (MSSA) as new optimization algorithms for solving optimization problems with single and multiple objectives. …”
Get full text
-
4
A new multimodulus blind equalization algorithm
Published 2004“…A new algorithm is presented for the blind equalization of complex signals. …”
Get full text
Get full text
article -
5
A new reactive power optimization algorithm
Published 2003“…A new implementation for the particle swarm algorithm has been applied. …”
Get full text
Get full text
article -
6
A new genetic algorithm approach for unit commitment
Published 1997“…This paper presents a new genetic algorithm approach to solve the unit commitment problem in electric power systems. …”
Get full text
Get full text
article -
7
New fault models and efficient BIST algorithms for dual-portmemories
Published 1997“…In addition to the classical static neighborhood pattern-sensitive faults, the array test algorithm covers a new class of pattern sensitive faults, duplex dynamic neighborhood pattern-sensitive faults (DDNPSF)…”
Get full text
Get full text
article -
8
A new tabu search algorithm for the long-term hydro scheduling problem
Published 2002“…A new efficient algorithm to solve the long-term hydro scheduling problem (LTHSP) is presented in this paper. …”
Get full text
Get full text
article -
9
A New Genetic-Based Tabu Search Algorithm For Unit Commitment Problem
Published 2020“…This paper presents a new algorithm based on integrating the use of genetic algorithms and tabu search methods to solve the unit commitment problem. …”
Get full text
article -
10
New Fast Arctangent Approximation Algorithm for Generic Real-Time Embedded Applications
Published 2019“…This paper presents a novel technique that combines the advantages of both rational formulae and LUT approximation methods. The new algorithm exploits the pseudo-linear region around the tangent function zero point to estimate a reduced input arctangent through a modified rational approximation before referring this estimate to its original value using miniature LUTs. …”
-
11
Iterative Least Squares Functional Networks Classifier
Published 2007“…This paper proposes unconstrained functional networks as a new classifier to deal with the pattern recognition problems. …”
Get full text
Get full text
article -
12
Evolution Of Activation Functions for Neural Architecture Search
Published 2020“…In this work, we propose the use of a self-adaptive evolutionary algorithm that searches for new activation functions using a genetic programming approach, and we compare the performance of the obtained activation functions to ReLU. …”
Get full text
Get full text
Get full text
masterThesis -
13
Accommodating High Penetrations of Renewable Distributed Generation Mix in Smart Grids
Published 2017Get full text
doctoralThesis -
14
Stochastic evolution algorithm for technology mapping
Published 1998“…SELF-Map is based on the Stochastic Evolution (SE) algorithm. The state space model of the problem is defined and suitable cost function which allows optimization for area, delay, or area-delay combinations is proposed. …”
Get full text
Get full text
article -
15
New aspect-oriented constructs for security hardening concerns
Published 2009“…We find these pointcuts and primitives to be necessary because they are needed to perform many security hardening practices and, to the best of our knowledge, none of the existing ones can provide their functionalities. Moreover, we show the viability and correctness of the proposed pointcuts and primitives by elaborating and implementing their algorithms and presenting the result of explanatory case studies.…”
Get full text
Get full text
Get full text
article -
16
New primitives to AOP weaving capabilities for security hardening concerns
Published 2007“…In this paper, we present two new primitives to Aspect-Oriented Programming (AOP) languages that are needed for systematic hardening of security concerns. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
17
An incremental approach for test scheduling and synthesis using genetic algorithms
Published 2017“…This paper presents a new and an efficient method for concurrent BIST synthesis and test scheduling. …”
Get full text
Get full text
Get full text
Get full text
conferenceObject -
18
Economic load dispatch using memetic sine cosine algorithm
Published 2022“…In a nutshell, hybridizing βHC optimizer as a new operator for SCA is very powerful algorithm for tackling ELD problems.…”
Get full text
-
19
Performance assessment and exhaustive listing of 500+ nature-inspired metaheuristic algorithms
Published 2023“…It should be noted that, except EBCM, the other 10 new algorithms are inferior to the 4 state-of-the-art algorithms in terms of convergence speed and global search ability on CEC 2017 functions. …”
-
20
Integrating genetic algorithms, tabu search, and simulatedannealing for the unit commitment problem
Published 1999“…This paper presents a new algorithm based on integrating genetic algorithms, tabu search and simulated annealing methods to solve the unit commitment problem. …”
Get full text
Get full text
article