Search alternatives:
many » may (Expand Search)
Showing 61 - 80 results of 4,135 for search 'many algorithm', query time: 0.11s Refine Results
  1. 61

    RBF-Learning-Based Many-Objective Metaheuristic for Robust and Optimal Controller Design in Fixed-Structure Heading Autopilot by Nattapong Ruenruedeepan, Sujin Bureerat, Natee Panagant, Nantiwat Pholdee

    Published 2025-05-01
    “…This paper presents an innovative many-objective metaheuristic (MnMH) algorithm designed to tackle the challenges of robust and optimal controller design for fixed-structure heading autopilots. …”
    Get full text
    Article
  2. 62

    A local search with chain search path strategy for real-world many-objective vehicle routing problem by Ying Zhou, Lingjing Kong, Hui Wang, Yiqiao Cai, Shaopeng Liu

    Published 2025-03-01
    “…This strategy can help the algorithm find a high-quality solution set quickly. …”
    Get full text
    Article
  3. 63
  4. 64

    Generating approximate ground states of strongly correlated quantum many-body systems through quantum imaginary time evolution by Michael Kaicher, Florian Dommert, Christopher Wever, Maximilian Amsler, Michael Kühn, QUTAC Material Science Working Group

    Published 2025-01-01
    “…Most quantum algorithms designed to generate or probe properties of the ground state of a quantum many-body system require as input an initial state with a large overlap with the desired ground state. …”
    Get full text
    Article
  5. 65

    Mann-Type Viscosity Approximation Methods for Multivalued Variational Inclusions with Finitely Many Variational Inequality Constraints in Banach Spaces by Lu-Chuan Ceng, Abdul Latif, Abdullah E. Al-Mazrooei

    Published 2013-01-01
    “…We consider and analyze Mann-type viscosity iterative algorithms not only in the setting of uniformly convex and 2-uniformly smooth Banach space but also in a uniformly convex Banach space having a uniformly Gáteaux differentiable norm. …”
    Get full text
    Article
  6. 66

    IMPROVEMENTS TO THE BACKPROPAGATION ALGORITHM by MIRCEA PETRINI

    Published 2012-12-01
    “…This paper presents some simple techniques to improve the backpropagation algorithm. Since learning in neural networks is an NP-complete problem and since traditional gradient descent methods are rather slow, many alternatives have been tried in order to accelerate convergence. …”
    Get full text
    Article
  7. 67

    Algorithms and Inertial Algorithms for Inverse Mixed Variational Inequality Problems in Hilbert Spaces by Chih-Sheng Chuang

    Published 2025-06-01
    “…The inverse mixed variational inequality problem comes from classical variational inequality, and it has many applications. In this paper, we propose new algorithms to study the inverse mixed variational inequality problems in Hilbert spaces, and these algorithms are based on the generalized projection operator. …”
    Get full text
    Article
  8. 68

    Branch and Bound Algorithm for the Traveling Salesman Problem is not a Direct Type Algorithm by Aleksandr N. Maksimenko

    Published 2020-03-01
    “…In 2015-2018, there were five papers published, the main results of which are estimates of the clique numbers of polyhedron graphs associated with various combinatorial optimization problems. the main motivation in these works is the thesis that the class of direct type algorithms is wide and includes many classical combinatorial algorithms, including the branch and bound algorithm for the traveling salesman problem, proposed by J. …”
    Get full text
    Article
  9. 69

    MC64-ClustalWP2: a highly-parallel hybrid strategy to align multiple sequences in many-core architectures. by David Díaz, Francisco J Esteban, Pilar Hernández, Juan Antonio Caballero, Antonio Guevara, Gabriel Dorado, Sergio Gálvez

    Published 2014-01-01
    “…We have developed the MC64-ClustalWP2 as a new implementation of the Clustal W algorithm, integrating a novel parallelization strategy and significantly increasing the performance when aligning long sequences in architectures with many cores. …”
    Get full text
    Article
  10. 70

    Evolving Many-Objective Job Shop Scheduling Dispatching Rules via Genetic Programming With Adaptive Search Based on the Frequency of Features by Atiya Masood, Mansoor Ebrahim, Fahad Najeeb, Syed Muhammad Daniyal

    Published 2025-01-01
    “…However, more research is needed to quantify the contribution of features in the GPHH to many-objective JSS. The proposed algorithm introduces an adaptive search strategy that is implemented through re-initialization during the evolutionary process. …”
    Get full text
    Article
  11. 71

    Cluster-projected matrix product state: Framework for engineering exact quantum many-body ground states in one and two dimensions by Hidehiro Saito, Chisa Hotta

    Published 2025-01-01
    “…We propose a framework to design concurrently a frustration-free quantum many-body Hamiltonian and its numerically exact ground states on a sufficiently large finite-size cluster in one and two dimensions using an elementary matrix product state (MPS) representation. …”
    Get full text
    Article
  12. 72

    REVIEW OF FEATURE SELECTION METHODS USING OPTIMIZATION ALGORITHM (Review paper for optimization algorithm) by Zana O. Hamad

    Published 2023-09-01
    “…Many works have been done to reduce complexity in terms of time and memory space. …”
    Get full text
    Article
  13. 73

    Triple Mann Iteration Method for Variational Inclusions, Equilibria, and Common Fixed Points of Finitely Many Quasi-Nonexpansive Mappings on Hadamard Manifolds by Lu-Chuan Ceng, Yun-Yi Huang, Si-Ying Li, Jen-Chih Yao

    Published 2025-01-01
    “…Through some suitable assumptions, we prove that the sequence constructed in the suggested algorithm is convergent to an element in the set of common solutions. …”
    Get full text
    Article
  14. 74

    Parallel Computing for Sorting Algorithms by Baghdad Science Journal

    Published 2014-06-01
    “…Because sorted data are easier to manipulate than randomly ordered data, many algorithms require sorted data. Sorting is of additional importance to parallel computing because of its close relation to the task of routing data among processes, which is an essential part of many parallel algorithms. …”
    Get full text
    Article
  15. 75

    An Algorithmic Framework for Multiobjective Optimization by T. Ganesan, I. Elamvazuthi, Ku Zilati Ku Shaari, P. Vasant

    Published 2013-01-01
    “…Multiobjective (MO) optimization is an emerging field which is increasingly being encountered in many fields globally. Various metaheuristic techniques such as differential evolution (DE), genetic algorithm (GA), gravitational search algorithm (GSA), and particle swarm optimization (PSO) have been used in conjunction with scalarization techniques such as weighted sum approach and the normal-boundary intersection (NBI) method to solve MO problems. …”
    Get full text
    Article
  16. 76

    Hybrid Algorithm for Image Denoising by Hanan Ali

    Published 2008-06-01
    “…The development in life has made the need for using images very important in many fields like space, engineering and medicine. …”
    Get full text
    Article
  17. 77

    Development Binary Search Algorithm by Baghdad Science Journal

    Published 2011-06-01
    “…There are many methods of searching large amount of data to find one particular piece of information. …”
    Get full text
    Article
  18. 78

    Distributivity, partitioning, and the multiplication algorithm by Chris Hurst, Ray Huntley

    Published 2020-07-01
    “…It is important that students understand how the property informs the written multiplication algorithm. Another component of successful use of the standard multiplication algorithm is extended number facts and the paper also explores students’ ability to understand and generate them. …”
    Get full text
    Article
  19. 79

    Comparative study of whale optimization algorithm and flower pollination algorithm to solve workers assignment problem by Huthaifa Al-Khazraji

    Published 2022-01-01
    “…Many important problems in engineering management can be formulated as Resource Assignment Problem (RAP). …”
    Get full text
    Article
  20. 80