Search Results - (( using equalization based algorithm ) OR ( using optimization modified algorithm ))

Search alternatives:

Refine Results
  1. 1
    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification

    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Jamaluddin, Hishamuddin, Abd. Samad, M. F., Ahmad, Robiah, Yaacob, M. S.

    Published 2007
    “…Several simulated systems and real-world timedependent data are used in the investigation. Comparisons based on widely used optimization performance indicators along with outcomes from other research are used. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification

    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Jamaluddin, H., Samad, M. F. A., Ahmad, R., Yaacob, M. S.

    Published 2007
    “…Several simulated systems and real-world timedependent data, are used in the investigation. Comparisons based on widely used optimization performance indicators along with outcomes from other research are used. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification

    Optimum grouping in a modified genetic algorithm for discrete-time, non-linear system identification by Abd Samad, Md Fahmi

    Published 2007
    “…Several simulated systems and real-world timedependent data are used in the investigation. Comparisons based on widely used optimization performance indicators along with outcomes from other research are used. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…The second approach is the modification of heuristic computation using original A* and modified Bresenham. Bresenham Line Algorithm is a line generation algorithm using integer arithmetic where the points (x1, y1) and (x2, y2) are assumed not equal and integer valued. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Modified ant colony optimization algorithms for deterministic and stochastic inventory routing problems / Lily Wong

    Modified ant colony optimization algorithms for deterministic and stochastic inventory routing problems / Lily Wong by Lily , Wong

    Published 2018
    “…The computational results also show that the algorithms of population based ACO performs better than the algorithms of non-population based ACO. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    A comparison of watermarking image quality based on dual intermediate significant bit with genetic algorithm

    A comparison of watermarking image quality based on dual intermediate significant bit with genetic algorithm by Yasin, Azman, M. Zeki, Akram, Mohammed, Ghassan N.

    Published 2013
    “…In this case, when the two hidden bits are equal to the original bits, there will be no change to the other remaining bits.However, if the original value is not equal to the embedded one, the nearest pixel to the original one will be chosen as the watermarked image.The second method, GA method is used to embed two bits of watermarking data within every pixel of the original image and to find the optimal value based on the existing DISB.On the other hand, if the two embedded bits are equal to the original bits then this means the watermarked image is still the same as the original one without any changes, while in the other case GA is used in determining the minimum fitness value in which the fittest is the absolute value between the pixel and chromosome and the value of chromosome between 0-255.The results indicate that the two methods produce a high quality watermarked image, but there is a big difference in the processing time, so the DISB method is faster than the GA method.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Artificial Bee Colony-based satellite image contrast and brightness enhancement technique using DWT-SVD

    Artificial Bee Colony-based satellite image contrast and brightness enhancement technique using DWT-SVD by Bhandari, A.K., Soni, V., Kumar, A., Singh, G.K.

    Published 2014
    “…The proposed technique is based on the Artificial Bee Colony (ABC) algorithm using Discrete Wavelet Transform and Singular Value Decomposition (DWT-SVD). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    New global maximum power point tracking and modular voltage equalizer topology for partially shaded photovoltaic system / Immad Shams

    New global maximum power point tracking and modular voltage equalizer topology for partially shaded photovoltaic system / Immad Shams by Immad , Shams

    Published 2022
    “…In terms of controller-based, in this work, a new global maximum power point tracking (GMPPT) algorithm based on a modified butterfly optimization algorithm (MBOA) has been proposed. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks

    Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks by Raja Mohd Auzar, Tengku Dian Shahida

    Published 2009
    “…Based on Zero algorithms, a Modified Zero algorithm is developed to achieve a crosstalk-free version of the algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Fair bandwidth distribution marking and scheduling algorithm in network traffic classification

    Fair bandwidth distribution marking and scheduling algorithm in network traffic classification by Al-Kharasani, Ameen Mohammed Abdulkarem

    Published 2019
    “…Second, an Optimized time sliding window packet marker (OTSWTCM) algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    A modified weighted support vector machine (WSVM) to reduce noise data in classification problem

    A modified weighted support vector machine (WSVM) to reduce noise data in classification problem by Mohd Dzulkifli, Syarizul Amri

    Published 2021
    “…When noise exists in training data, the decision boundary of SVM would deviate from the optimal hyperplane severely. To overcome SVM drawback for noise data problem, WSVM using KPCM algorithm was used but WSVM using kernel-based learning algorithm such as KPCM algorithm suffer from training complexity, expensive computation time and storage memory when noise data contaminate training data. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    A modified weighted support vector machine (WSVM) to reduce noise data in classification problem

    A modified weighted support vector machine (WSVM) to reduce noise data in classification problem by Mohd Dzulkifli, Syarizul Amri

    Published 2021
    “…When noise exists in training data, the decision boundary of SVM would deviate from the optimal hyperplane severely. To overcome SVM drawback for noise data problem, WSVM using KPCM algorithm was used but WSVM using kernel-based learning algorithm such as KPCM algorithm suffer from training complexity, expensive computation time and storage memory when noise data contaminate training data. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Amtree Protocol Enhancement by Multicast Tree Modification and Incorporation of Multiple Sources

    Amtree Protocol Enhancement by Multicast Tree Modification and Incorporation of Multiple Sources by Al‐Sharafi, Ali Mohammed Ali

    Published 2008
    “…The results from experiments show that handoff latency using the new algorithms is much lower than using AMTree handoff procedure in both cases, i.e. when the source connects to a subscribed base station or not subscribed base station. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Dynamic reconfiguration of large-scale PV plant using based on specified switching matrix and genetic algorithm to mitigate partial shading

    Dynamic reconfiguration of large-scale PV plant using based on specified switching matrix and genetic algorithm to mitigate partial shading by Aidha Muhammad Ajmal

    Published 2023
    “…In the second stage, Genetic Algorithm (GA) is applied to optimize the output, via rearranging the columns in PV plants to find the optimal solution of reconfiguration. …”
    text::Thesis
    Save to List
    Saved in:
  15. 15
    Optimization of modified Bouc–Wen model for magnetorheological damper using modified cuckoo search algorithm

    Optimization of modified Bouc–Wen model for magnetorheological damper using modified cuckoo search algorithm by Rosmazi, Rosli, Zamri, Mohamed

    Published 2021
    “…A comparison was done against particle swarm optimization, genetic algorithm, and sine–cosine algorithm, where the modified cuckoo search algorithm showed the lowest root mean square error and fastest convergence rate among the three algorithms.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    A novel quasi-oppositional modified Jaya algorithm for multi-objective optimal power flow solution

    A novel quasi-oppositional modified Jaya algorithm for multi-objective optimal power flow solution by Warid, Warid, Hizam, Hashim, Mariun, Norman, Abdul Wahab, Noor Izzri

    Published 2018
    “…The proposed algorithm is scrutinized and validated using the modified IEEE 30-bus test system. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Wind farm layout design using modified particle swarm optimization algorithm

    Wind farm layout design using modified particle swarm optimization algorithm by Rehman, S., Ali, S.S.A.

    Published 2015
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Modified multi verse optimizer for solving optimization problems using benchmark functions

    Modified multi verse optimizer for solving optimization problems using benchmark functions by Jui, Julakha Jahan, Mohd Ashraf, Ahmad, Muhammad Ikram, Mohd Rashid

    Published 2020
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Optimized clustering with modified K-means algorithm

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Clustering technique is able to find hidden patterns and to extract useful information from huge data. Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Optimal power flow based on fuzzy linear programming and modified Jaya algorithms

    Optimal power flow based on fuzzy linear programming and modified Jaya algorithms by Alzihaymee, Warid Sayel Warid

    Published 2017
    “…A set of modified and novel optimization algorithms are proposed in this thesis to deal with different single and multi-objective OPF problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: