Search Results - (( basic optimization based algorithm ) OR ( using vector problem algorithm ))

Search alternatives:

Refine Results
  1. 1
    Implementation of Symmetric Rank-One Methods for Unconstrained Optimization

    Implementation of Symmetric Rank-One Methods for Unconstrained Optimization by Khiyaban, Farzin Modarres

    Published 2010
    “…A review of di®erent minimization methods that can be used to solve unconstrained optimization problems is also given. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    An Optimized Support Vector Machine (SVM) based on Particle Swarm Optimization (PSO) for cryptocurrency forecasting

    An Optimized Support Vector Machine (SVM) based on Particle Swarm Optimization (PSO) for cryptocurrency forecasting by Hitam, Nor Azizah, Ismail, Amelia Ritahani, Saeed, Faisal

    Published 2019
    “…However, forecasting result using basic SVM algorithms does not really promising. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  3. 3
    An enhanced minimum variance distortionless response beamformer techniques to reduce interference in array antenna system

    An enhanced minimum variance distortionless response beamformer techniques to reduce interference in array antenna system by Shahab, Suhail Najm

    Published 2017
    “…Metaheuristic optimization algorithms are used widely to solve many engineering problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Solving power system state estimation using orthogonal decomposition algorithm / Tey Siew Kian

    Solving power system state estimation using orthogonal decomposition algorithm / Tey Siew Kian by Tey, Siew Kian

    Published 2009
    “…This optimal state estimate and corrected data base are then used by the security monitoring and operation and control functions of the center.Most state estimation programs in practical use are formulated as overdetermined systems (Pozrikidis, 2008) of nonlinear equations and solved as weighted least square problems (refer to section 2.1.1).This research involves finding the least squares solution of the power system state estimation problem, HTR-1HDx = HTR-1 [z - f (x)] (refer to section 2.3.1) and to develop a program to implement the said algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    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
    “…In the proposed novel QOJaya algorithm, an intelligence strategy, namely, quasi-oppositional based learning (QOBL) is incorporated into the basic Jaya algorithm to enhance its convergence speed and solution optimality. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Vector Evaluated Gravitational Search Algorithm (VEGSA) for multi-objective optimization problems

    Vector Evaluated Gravitational Search Algorithm (VEGSA) for multi-objective optimization problems by Zuwairie, Ibrahim, Badaruddin, Muhammad, Kamarul Hawari, Ghazali, Lim, Kian Sheng, Sophan Wahyudi, Nawawi, Zulkifli, Md. Yusof

    Published 2012
    “…The proposed algorithm, which is called Vector Evaluated Gravitational Search Algorithm (VEGSA), uses a number of populations of particles. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems

    Fuzzy adaptive teaching learning-based optimization for solving unconstrained numerical optimization problems by Din, Fakhrud, Khalid, Shah, Fayaz, Muhammad, Gwak, Jeonghwan, Kamal Z., Zamli, Mashwani, Wali Khan

    Published 2022
    “…The performance of the fuzzy adaptive teaching learning-based optimization is evaluated against other metaheuristic algorithms including basic teaching learning-based optimization on 23 unconstrained global test functions. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Improving Vector Evaluated Particle Swarm Optimisation by Incorporating Nondominated Solutions

    Improving Vector Evaluated Particle Swarm Optimisation by Incorporating Nondominated Solutions by Kian, Sheng Lim, Zuwairie, Ibrahim, Salinda, Buyamin, Anita, Ahmad, Faradila, Naim, Kamarul Hawari, Ghazali, Norrima, Mokhtar

    Published 2013
    “…The Vector Evaluated Particle Swarm Optimisation algorithm is widely used to solve multiobjective optimisation problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    A Method For Solving Mult-Objective Optimization Problem: Vector Evaluated Genetic Algorithm (Vega)

    A Method For Solving Mult-Objective Optimization Problem: Vector Evaluated Genetic Algorithm (Vega) by Tan, Tun Tai

    Published 2009
    “…However, it is impractical to solve MOOP by using classical methods due to its complexity. Genetic Algorithms (GAs) are a powerful stochastic search in solving optimization problems. …”
    Get full text
    Get full text
    Final Year Project Report / IMRAD
    Save to List
    Saved in:
  10. 10
    A Test Vector Minimization Algorithm Based On Delta Debugging For Post-Silicon Validation Of Pcie Rootport

    A Test Vector Minimization Algorithm Based On Delta Debugging For Post-Silicon Validation Of Pcie Rootport by Toh , Yi Feng

    Published 2017
    “…To solve the problem, a test vector minimizer algorithm is proposed to eliminate redundant test vectors that do not contribute to reproduction of a test failure, hence, improving the debug throughput. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Using the bees algorithm to optimise a support vector machine for wood defect classification

    Using the bees algorithm to optimise a support vector machine for wood defect classification by Pham, D.T, Muhammad, Zaidi, Mahmuddin, Massudi, Ghanbarzadeh, Afshin, Koc, Ebubekir, Otri, Sameh

    Published 2007
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    Enhanced artificial bee colony-least squares support vector machines algorithm for time series prediction

    Enhanced artificial bee colony-least squares support vector machines algorithm for time series prediction by Zuriani, Mustaffa

    Published 2014
    “…The lvABC algorithm is introduced to overcome the local optima problem by enriching the searching behaviour using Levy mutation. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier

    Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    A Multi-objective Evolutionary Algorithm Based On Decomposition For Continuous Optimization Using A Step-function Technique

    A Multi-objective Evolutionary Algorithm Based On Decomposition For Continuous Optimization Using A Step-function Technique by Chuah, How Siang

    Published 2022
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Improving performance of mobile ad hoc networks using efficient Tactical On Demand Distance Vector (TAODV) routing algorithm

    Improving performance of mobile ad hoc networks using efficient Tactical On Demand Distance Vector (TAODV) routing algorithm by Uddin, Mueen, Abdul Rahman, Azizah, Alarifi, Abdulrahman, Talha, Muhammad, Shah, Asadullah, Iftikhar, Mohsin, Zomaya, Albert

    Published 2012
    “…The proposed TAODV algorithm performs better for solving routing problems in Mobile Ad Hoc networks. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Convergence and Diversity Evaluation for Vector Evaluated Particle Swarm Optimization

    Convergence and Diversity Evaluation for Vector Evaluated Particle Swarm Optimization by Mohd Zaidi, Mohd Tumari, Zuwairie, Ibrahim, Ismail, Ibrahim, Mohd Falfazli, Mat Jusof, Faradila, Naim, Kamarul Hawari, Ghazali, Lim, Kian Sheng, Salinda, Buyamin, Anita, Ahmad

    Published 2013
    “…An extended PSO algorithm called Vector Evaluated Particle Swarm Optimization (VEPSO) has been introduced to solve multi-objective optimization problems. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  17. 17
    Solving Support Vector Machine Model Selection Problem Using Continuous Ant Colony Optimization

    Solving Support Vector Machine Model Selection Problem Using Continuous Ant Colony Optimization by Alwan, Hiba Basim, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Ant Colony Optimization has been used to solve Support Vector Machine model selection problem.Ant Colony Optimization originally deals with discrete optimization problem.In applying Ant Colony Optimization for optimizing Support Vector Machine parameters which are continuous variables, there is a need to discretize the continuously value into discrete value.This discretize process would result in loss of some information and hence affect the classification accuracy and seeking time.This study proposes an algorithm that can optimize Support Vector Machine parameters using Continuous Ant Colony Optimization without the need to discretize continuous value for Support Vector Machine parameters.Eight datasets from UCI were used to evaluate the credibility of the proposed hybrid algorithm in terms of classification accuracy and size of features subset.Promising results were obtained when compared to grid search technique, GA with feature chromosome-SVM, PSO-SVM, and GA-SVM.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    A hybrid algorithm based on artificial bee colony and artificial rabbits optimization for solving economic dispatch problem

    A hybrid algorithm based on artificial bee colony and artificial rabbits optimization for solving economic dispatch problem by Lee, Wei Wen, Hashim, Mohd Ruzaini

    Published 2023
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Voting algorithms for large scale fault-tolerant systems

    Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

    Published 2011
    “…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…Several variants of PSO have been proposed for solving discrete optimization problems like TSP. Among them, the basic algorithm is the Swap Sequence based PSO (SSPSO), however, it does not perform well in providing high quality solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: