Search Results - (( based optimization method algorithm ) OR ( sequence optimization search algorithm ))

Search alternatives:

Refine Results
  1. 1
    Product assembly sequence optimization based on genetic algorithm

    Product assembly sequence optimization based on genetic algorithm by Yasin, Azman, Puteh, Nurnasran, Daud, Ruslizam, Omar, Mazni, Syed-Abdullah, Sharifah Lailee

    Published 2010
    “…Genetic algorithm (GA) is a search technique used in computing to find approximate solution to optimization and search problem based on the theory of natural selection. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    An assembly sequence planning approach with a rule-based multi-state gravitational search algorithm

    An assembly sequence planning approach with a rule-based multi-state gravitational search algorithm by Ibrahim, I., Ibrahim, Z., Ahmad, Hamzah, Jusof, M.F.M., Yusof, Z.M., Nawawi, S.W., Mubin, M.

    Published 2015
    “…In this paper, an approach based on a new variant of the gravitational search algorithm (GSA) called the rule-based multi-state gravitational search algorithm (RBMSGSA) is used to solve the assembly sequence planning problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    An Assembly Sequence Planning Approach with a Rule-based Multi-state Gravitational Search Algorithm

    An Assembly Sequence Planning Approach with a Rule-based Multi-state Gravitational Search Algorithm by Ismail, Ibrahim, Zuwairie, Ibrahim, Hamzah, Ahmad, Mohd Falfazli, Mat Jusof, Zulkifli, Md. Yusof, Sophan Wahyudi, Nawawi, Marizan, Mubin

    Published 2015
    “…In this paper, an approach based on a new variant of the gravitational search algorithm (GSA) called the rule-based multi-state gravitational search algorithm (RBMSGSA) is used to solve the assembly sequence planning problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences

    Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

    Published 2024
    journal::journal article
    Save to List
    Saved in:
  5. 5
    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems

    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems by Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Bin Ag. Ibrahim, Muhammad Reazul Haque, Joel J. P. C. Rodrigues, Danda B. Rawat

    Published 2021
    “…Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Design of DNA sequence alignment accelerated system using 2-dimensional array and custom instruction on FPGA / Nur Dalilah Ahmad Sabri

    Design of DNA sequence alignment accelerated system using 2-dimensional array and custom instruction on FPGA / Nur Dalilah Ahmad Sabri by Ahmad Sabri, Nur Dalilah

    Published 2018
    “…Thus, this research concentrates on the optimization techniques based on Custom Instruction (CI) and Rectangular Dimensional array (2D) that proposed on Smith-Waterman (SW) algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Multilevel optimization for dense motion estimation

    Multilevel optimization for dense motion estimation by Saaban, Azizan, Kalmoun, El Mostafa, Ibrahim, Haslinda, Ramli, Razamin, Omar, Zurni

    Published 2011
    “…We evaluated the performance of different optimization techniques developed in the context of optical flow computation with different variational models.In particular, based on truncated Newton methods (TN) that have been an effective approach for large-scale unconstrained optimization, we developed the use of efficient multilevel schemes for computing the optical flow.More precisely, we evaluated the performance of a standard unidirectional multilevel algorithm - called multiresolution optimization (MR/Opt), to a bidrectional multilevel algorithm - called full multigrid optimization (FMG/Opt).The FMG/Opt algorithm treats the coarse grid correction as an optimization search direction and eventually scales it using a line search. …”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  8. 8
    Block based motion vector estimation using fuhs16 uhds16 and uhds8 algorithms for video sequence

    Block based motion vector estimation using fuhs16 uhds16 and uhds8 algorithms for video sequence by S. S. S. , Ranjit

    Published 2011
    “…Full search (FS), three step search (TSS), new three step search (NTSS), diamond search (DS) and hexagon based search (HS) are the most well known block-matching algorithm. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  9. 9
    Studying the Impact of Initialization for Population-Based Algorithms with Low-Discrepancy Sequences

    Studying the Impact of Initialization for Population-Based Algorithms with Low-Discrepancy Sequences by Adnan Ashraf, Sobia Pervaiz, Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Ag. Ibrahim, Joel J. P. C. Rodrigues, Danda B. Rawat

    Published 2021
    “…To solve different kinds of optimization challenges, meta-heuristic algorithms have been extensively used. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Particle swarm optimization with partial search to solve traveling salesman problem

    Particle swarm optimization with partial search to solve traveling salesman problem by Akhand, M.A.H., Akter, Shahina, Rahman, S. Sazzadur, Rahman, M.M. Hafizur

    Published 2012
    “…The objective of the study is to achieve better result introducing using such partial search option for solving TSP. The proposed PSO with Partial Search (PSOPS) algorithm is shown to produce optimal solution within a less number of generation than standard PSO, Genetic Algorithm in solving benchmark TSP.…”
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  11. 11
    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    “…The problem was initially tackled by “exact methods” such as the branch and bound method, which is based on the exhaustive enumeration of a restricted region of solutions containing exact optimal solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures

    Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

    Published 2020
    “…For these reasons, to improve the time and accuracy of the coverage in population-based meta-heuristics and their utilization in HPAs, this thesis presents a novel optimization algorithm called the Raccoon Optimization Algorithm (ROA). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Safe experimentation dynamics algorithm for data-driven PID controller of a class of underactuated systems

    Safe experimentation dynamics algorithm for data-driven PID controller of a class of underactuated systems by Nor Sakinah, Abdul Shukor

    Published 2019
    “…Moreover, other than the memory-based feature, SED algorithm has fewer design parameters to be addressed and the independence of the gain sequence in the tuning process. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Safe experimentation dynamics algorithm for data-driven PID controller of a class of underactuated systems

    Safe experimentation dynamics algorithm for data-driven PID controller of a class of underactuated systems by Nor Sakinah, Abdul Shukor

    Published 2019
    “…Moreover, other than the memory-based feature, SED algorithm has fewer design parameters to be addressed and the independence of the gain sequence in the tuning process. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem

    Vector evaluated particle swarm optimization approach to solve assembly sequence planning problem by A. Mukred, Jameel A., A. Rahim, Ruzairi, Mohamad, Elmy Johana, Salh, Adeeb, Ashyap, Adel Y. I., Abdullah, Qazwan, AL-Fadhali, Najib, Al-Ameri, S., Al-Ashwal, Rania

    Published 2022
    “…Meta-heuristic method is able to escape the local optima. Simulated Annealing (SA) is used where search is done in sequence basis and to solve optimization problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Global and local convergence of a filter line search method for nonlinear programming.

    Global and local convergence of a filter line search method for nonlinear programming. by Chin, Choong Ming, Abdul Rashid, Abdul Halim, Nor, Khaled Mohamed

    Published 2007
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    T-way strategy for sequence input interactions test case generation adopting fish swarm algorithm

    T-way strategy for sequence input interactions test case generation adopting fish swarm algorithm by Rahman, Mostafijur, Sultana, Dalia, Sabira, Khatun, M. F. M., Jusof, Syamimi Mardiah, Shaharum, Nurhafizah, Abu Talip Yusof, Qaiduzzaman, Khandker M., Hasan, Md. Hasibul, Rahman, Md. Mushfiqur, Hossen, Md. Anwar, Begum, Afsana

    Published 2019
    “…The proposed system is compared with the other renowned search-based Tway strategies. The result shows that the proposed system is able to generate feasible and optimal results.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems

    Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems by Woon, Siew Fang

    Published 2009
    “…One of the more recent global optimization tools in the area of discrete optimization is known as the discrete filled function method. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    DNA motif identification using LPBS

    DNA motif identification using LPBS by Harun, Hazaruddin, Syed Abdullah, Sharifah Lailee, Hambali, Hamirul ’Aini

    Published 2016
    “…The new method named as Linear-PSO with Binary Search (LPBS) is developed to discover motifs of specific species through DNA sequences. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Neural network-based codebook search for image compression

    Neural network-based codebook search for image compression by Bodruzzaman, M., Gupta, R., Karim, M.R., Bodruzzaman, S.

    Published 2000
    “…Since the candidate set is usually much smaller that the whole code book, there is a substantial saving in codebook search time for coding an image as compared to the traditional method using full codebook search by LBG algorithm.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: