Search alternatives:
optimizations algorithm » optimization algorithms (Expand Search)
monkey optimizations » policy optimization (Expand Search), motor optimization (Expand Search)
Showing 21 - 40 results of 57 for search '(( (unconstrained OR constrained) optimization algorithm ) OR ( monkey optimizations algorithm ))', query time: 0.14s Refine Results
  1. 21

    Design and analysis of entropy-constrained reflected residual vector quantization by Mousa, W.A.H.

    Published 2002
    “…Residual vector quantization (RVQ) is a vector quantization (VQ) paradigm which imposes structural constraints on the encoder in order to reduce the encoding search burden and memory storage requirements of an unconstrained VQ. Jointly optimized RVQ (JORVQ) is an effective design algorithm for minimizing the overall quantization error. …”
    Get full text
    Get full text
    article
  2. 22

    UAV Trajectory Planning for Data Collection from Time-Constrained IoT Devices by Samir, Moataz

    Published 2019
    “…Then, we develop an effective sub-optimal algorithm based on successive convex approximation in order to obtain results for larger network scenarios. …”
    Get full text
    Get full text
    Get full text
    Get full text
    article
  3. 23

    Performance Assessment of Foraging Algorithms vs. Evolutionary Algorithms by El-Abd, Mohammed

    Published 2012
    “…This work provides a complete performance assessment of the four mentioned algorithms in comparison to the widely known differential evolution (DE), genetic algorithms (GAs), harmony search (HS), and particle swarm optimization (PSO) algorithms when applied to the problem of unconstrained nonlinear continuous function optimization. …”
    Get full text
    Get full text
  4. 24

    Trial-based dominance for comparing both the speed and accuracy of stochastic optimizers with standard non-parametric tests by Kenneth V. Price (17877002)

    Published 2023
    “…Simulations demonstrate that “U-scores” are much more effective than dominance when tasked with identifying the better of two algorithms. We validate U-scores by having them determine the winners of the CEC 2022 competition on single objective, bound-constrained numerical optimization.…”
  5. 25
  6. 26

    An evolutionary algorithm for network topology design by Youssef, H.

    Published 2001
    “…The topology design of campus networks is a hard constrained combinatorial optimization problem, dictated by physical and technological constraints and must optimize several objectives. …”
    Get full text
    Get full text
    article
  7. 27
  8. 28
  9. 29

    Optimal shunt compensators at nonsinusoidal busbars by El-Amin, I.M.

    Published 1995
    “…The Direct Search Polytope algorithm is used. The solution of this model yields an optimal shunt LC compensator for the nonlinear load. …”
    Get full text
    Get full text
    article
  10. 30

    Tabu search based circuit optimization by Sait, Sadiq M.

    Published 1998
    “…In this paper we address the problem of optimizing mixed CMOS/BiCMOS circuits. The problem is formulated as a constrained combinatorial optimization problem and solved using an tabu search algorithm. …”
    Get full text
    Get full text
    article
  11. 31

    Fuzzy simulated evolution algorithm for topology design of campusnetworks by Youssef, H.

    Published 2000
    “…The topology design of campus networks is a hard constrained combinatorial optimization problem. It consists of deciding the number, type, and location of the active network elements (nodes) and links. …”
    Get full text
    Get full text
    article
  12. 32

    Environmental/economic power dispatch using multiobjective evolutionary algorithms by Abido, M.A.

    Published 2003
    “…The EED problem is formulated as a nonlinear constrained multiobjective optimization problem. A new strength Pareto evolutionary algorithm (SPEA) based approach is proposed to handle the EED as a true multiobjective optimization problem with competing and noncommensurable objectives. …”
    Get full text
    Get full text
    article
  13. 33

    A FUZZY EVOLUTIONARY ALGORITHM FOR TOPOLOGY DESIGN OF CAMPUS NETWORKS by Youssef, H.

    Published 2020
    “…ABSTRACT The topology design of campus networks is a hard constrained combinatorial optimization problem. It consists of deciding the number, type, and location of the active network elements (nodes), and the links. …”
    Get full text
    article
  14. 34

    OPTIMAL SHUNT COMPENSATORS AT NON-SINUSOIDAL BUSBARS by El-Amin, I.M.

    Published 2020
    “…The Direct Search Polytope algorithm is used. The solution of this model yields an optimal shunt LC compensator for the nonlinear lend. …”
    Get full text
    article
  15. 35

    A new multiobjective evolutionary algorithm forenvironmental/economic power dispatch by Abido, A.A.

    Published 2001
    “…In this paper, a new multiobjective evolutionary algorithm for environmental/economic power dispatch (EED) optimization problem is presented. …”
    Get full text
    Get full text
    article
  16. 36

    An analytical framework for high-speed hardware particle swarm optimization by El-Abd, Mohammed

    Published 2020
    “…Engineering optimization techniques are computationally intensive and can challenge implementations on tightly-constrained embedded systems. …”
    Get full text
    Get full text
  17. 37
  18. 38

    Topology design of switched enterprise networks using a fuzzy simulated evolution algorithm by Youssef, H.

    Published 2020
    “…Abstract The topology design of switched enterprise networks (SENs) is a hard constrained combinatorial optimization problem. The problem consists of deciding the number, types, and locations of the network active elements (hubs, switches, and routers), as well as the links and their capacities. …”
    Get full text
    article
  19. 39

    Topology design of switched enterprise networks using a fuzzy simulated evolution algorithm by Youssef, H.

    Published 2020
    “…Abstract The topology design of switched enterprise networks (SENs) is a hard constrained combinatorial optimization problem. The problem consists of deciding the number, types, and locations of the network active elements (hubs, switches, and routers), as well as the links and their capacities. …”
    Get full text
    article
  20. 40

    Genetic Algorithm Analysis using the Graph Coloring Method for Solving the University Timetable Problem by Haraty, Ramzi A.

    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