Showing 1 - 20 results of 90 for search '(( algorithm steps function ) OR ((( algorithm both function ) OR ( algorithm python function ))))', query time: 0.13s Refine Results
  1. 1

    Tracking analysis of the NLMS algorithm in the presence of both random and cyclic nonstationarities by Moinuddin, M.

    Published 2003
    “…The results show that, unlike in the stationary case, the steady-state excess MSE is not a monotonically increasing function of the step size. Moreover, the ability of the adaptive algorithm to track the variations in the environment is shown to degrade with increasing frequency offset.…”
    Get full text
    Get full text
    article
  2. 2

    New enumeration algorithm for regular boolean functions by Nasrallah, Walid F.

    Published 2018
    “…After proving this equivalence, this paper introduces a novel data structure that may, with further tweaking, enable faster enumeration algorithms for both regular Boolean functions and all-capacities knapsack problem instances.…”
    Get full text
    Get full text
    Get full text
    Get full text
    conferenceObject
  3. 3

    A New Penalty Function Algorithm For Convex Quadratic Programming by Bendaya, M.

    Published 2020
    “…In this paper, we develop an exterior point algorithm for convex quadratic programming using a penalty function approach. …”
    Get full text
    article
  4. 4
  5. 5

    Adaptive step-size sign least mean squares by Aldajani, M.A.

    Published 2004
    “…A powerful adaptation scheme is used to adapt the step-size of the sign function inside the recursion of the sign algorithm. …”
    Get full text
    Get full text
    article
  6. 6

    Consensus-Based Distributed Formation Control of Multi-Quadcopter Systems: Barrier Lyapunov Function Approach by Nargess Sadeghzadeh-Nokhodberiz (16904952)

    Published 2023
    “…The method is firstly developed in a centralized scheme and then extended to a distributed framework using appropriate asymptotically convergent consensus algorithms. Therefore, the asymptotic convergence of the designed distributed algorithm to the centralized one is guaranteed. …”
  7. 7
  8. 8

    Optimum sensors allocation for drones multi-target tracking under complex environment using improved prairie dog optimization by Abu Zitar, Raed

    Published 2024
    “…This hybrid approach, the Improved Prairie Dog Optimization Algorithm (IPDOA) with the Genetic Algorithm (GA), utilizes the strengths of both algorithms to improve the overall optimization performance. …”
    Get full text
  9. 9
  10. 10

    Distributed optimal coverage control in multi-agent systems: Known and unknown environments by Mohammadhasan Faghihi (22303057)

    Published 2024
    “…The proposed technique offers an optimal solution with a lower cost with respect to conventional Voronoi-based techniques by effectively handling the issue of agents remaining stationary in regions void of information using a ranking function. The proposed approach leverages a novel cost function for optimizing the agents’ coverage and the cost function eventually aligns with the conventional Voronoi-based cost function. …”
  11. 11

    Iterative Least Squares Functional Networks Classifier by Faisal, Kanaan A

    Published 2007
    “…Both methodology and learning algorithm for this kind of computational intelligence classifier using the iterative least squares optimization criterion are derived. …”
    Get full text
    Get full text
    article
  12. 12

    Cross entropy error function in neural networks by Nasr, G.E.

    Published 2002
    “…The ANN is implemented using the cross entropy error function in the training stage. The cross entropy function is proven to accelerate the backpropagation algorithm and to provide good overall network performance with relatively short stagnation periods. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
  13. 13

    Tracking analysis of normalized adaptive algorithms by Moinuddin, M.

    Published 2003
    “…Close agreement between analytical analysis and simulation results is obtained for the case of the NLMS algorithm. The results show that, unlike the stationary case, the steady-state excess-mean-square error is not a monotonically increasing function of the step-size, while the ability of the adaptive algorithm to track the variations in the environment degrades by increasing the frequency offset.…”
    Get full text
    Get full text
    article
  14. 14

    A Comparative Study of Elgamal Based Cryptographic Algorithms by Haraty, Ramzi A.

    Published 2004
    “…In this work we implement the classical and modified ElGamal cryptosystem to compare and to test their functionality, reliability and security. To test the security of the algorithms we use a famous attack algorithm called Baby-Step-Giant algorithm which works in the domain of natural integers. …”
    Get full text
    Get full text
    Get full text
    conferenceObject
  15. 15

    New fault models and efficient BIST algorithms for dual-portmemories by Amin, A.A.

    Published 1997
    “…These modifications allow multiple access of memory cells for increased test speed with minimal overhead on both silicon area and device performance. New fault models are proposed, and efficient O(n) test algorithms are described for both the memory array and the address decoders. …”
    Get full text
    Get full text
    article
  16. 16

    A hybridization of evolution strategies with iterated greedy algorithm for no-wait flow shop scheduling problems by Bilal Khurshid (16715865)

    Published 2024
    “…<p dir="ltr">This study investigates the no-wait flow shop scheduling problem and proposes a hybrid (HES-IG) algorithm that utilizes makespan as the objective function. …”
  17. 17

    Convergence analysis of the variable weight mixed-norm LMS-LMFadaptive algorithm by Zerguine, A.

    Published 2000
    “…In this work, the convergence analysis of the variable weight mixed-norm LMS-LMF (least mean squares-least mean fourth) adaptive algorithm is derived. The proposed algorithm minimizes an objective function defined as a weighted sum of the LMS and LMF cost functions where the weighting factor is time varying and adapts itself so as to allow the algorithm to keep track of the variations in the environment. …”
    Get full text
    Get full text
    article
  18. 18

    A comparative study of ElGamal based digital signature algorithms by Haraty, Ramzi A.

    Published 2006
    “…We implement the classical and modified ElGamal digital signature scheme to compare and to test their functionality, reliability and security. To test the security of the algorithms we use a famous attack algorithm called Baby-Step-Giant algorithm which works in the domain of natural integers. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  19. 19
  20. 20

    An enhanced binary Rat Swarm Optimizer based on local-best concepts of PSO and collaborative crossover operators for feature selection by Abu Zitar, Raed

    Published 2022
    “…The binary enhanced RSO is built based on three successive modifications: i) an S-shape transfer function is used to develop binary RSO algorithms; ii) the local search paradigm of particle swarm optimization is used with the iterative loop of RSO to boost its local exploitation; iii) three crossover mechanisms are used and controlled by a switch probability to improve the diversity. …”