Search Results - (( variable based search algorithm ) OR ( java simulation optimization algorithm ))

Search alternatives:

Refine Results
  1. 1
    Variable block based motion estimation using hexagon diamond full search algorithm (HDFSA) via block subtraction technique

    Variable block based motion estimation using hexagon diamond full search algorithm (HDFSA) via block subtraction technique by Hardev Singh, Jitvinder Dev Singh

    Published 2015
    “…The variable block matching developed based on four stages which is the video and frame selection, threshold calculation, block size selection and search pattern. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    A new variable strength t-way strategy based on the cuckoo search algorithm

    A new variable strength t-way strategy based on the cuckoo search algorithm by Abdullah, Nasser, Kamal Z., Zamli

    Published 2019
    “…Many t-way testing strategies appear in the literature to date ranging from general computational ones to metaheuristic-based. Owing to its performance, the metaheuristicbased t-way strategies have gained significant attention recently (e.g., Particle swarmoptimization, genetic algorithm, ant colony algorithm, harmony search, and cuckoo search). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection

    Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

    Published 2022
    “…The simulation is implemented with iFogSim and java programming language. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  4. 4
    Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data

    Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

    Published 2023
    “…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data

    Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Saraf, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

    Published 2023
    “…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data

    Framework of Meta-Heuristic Variable Length Searching for Feature Selection in High-Dimensional Data by Qadir Sara, Tara Othman, Fuad, Norfaiza, Md Taujuddin, Nik Shahidah Afifi

    Published 2023
    “…The literature contains various meta-heuristic algorithms with variable length searching. All of them enable searching in high dimensional problems. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Ant colony optimization algorithm for load balancing in grid computing

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  9. 9
    Long-term electrical energy consumption: Formulating and forecasting via optimized gene expression programming / Seyed Hamidreza Aghay Kaboli

    Long-term electrical energy consumption: Formulating and forecasting via optimized gene expression programming / Seyed Hamidreza Aghay Kaboli by Seyed Hamidreza , Aghay Kaboli

    Published 2018
    “…In the developed feature selection approach, multi-objective binary-valued backtracking search algorithm (MOBBSA) is used as an efficient evolutionary search algorithm to search within different combinations of input variables and selects the non-dominated feature subsets, which minimize simultaneously both the estimation error and the number of features. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Electricity demand forecasting in Turkey and Indonesia using linear and nonlinear models based on real-value genetic algorithm and extended Nelder-Mead local search

    Electricity demand forecasting in Turkey and Indonesia using linear and nonlinear models based on real-value genetic algorithm and extended Nelder-Mead local search by Wahab, Musa

    Published 2014
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem

    A hybridisation of adaptive variable neighbourhood search and large neighbourhood search: Application to the vehicle routing problem by Sze, Jeeu Fong, Salhi, S., Wassan, N.

    Published 2016
    “…In this paper, an adaptive variable neighbourhood search (AVNS) algorithm that incorporates large neighbourhood search (LNS) as a diversification strategy is proposed and applied to the capacitated vehicle routing problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Harmony Search algorithm-based gasoline consumption modeling for Indonesia

    Harmony Search algorithm-based gasoline consumption modeling for Indonesia by Anggarani, Riesta, Watada, Junzo

    Published 2012
    Get full text
    Working Paper
    Save to List
    Saved in:
  13. 13
    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
    Save to List
    Saved in:
  14. 14
    Adopting A Particle Swarm-Based Test Generator Strategy For Variable-Strength And T-Way Testing

    Adopting A Particle Swarm-Based Test Generator Strategy For Variable-Strength And T-Way Testing by S. Ahmed, Bestoun

    Published 2011
    “…Many AI-based strategies have been developed, such as Ant Colony, Simulated Annealing, Genetic Algorithm, and Tabu Search. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria

    Dynamic Probability Selection for Flower Pollination Algorithm based on Metropolis-hastings Criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

    Published 2021
    “…Having only one parameter control (i.e. the switch probability, pa) to choose from the global search (i.e. exploration) and local search (i.e. exploitation) is the main strength of FPA as compared to other meta-heuristic algorithms. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Cuckoo search algorithm as an optimizer for optimal reactive power dispatch problems

    Cuckoo search algorithm as an optimizer for optimal reactive power dispatch problems by M. H., Sulaiman, Zuriani, Mustaffa

    Published 2017
    “…This paper presents the application of Cuckoo Search Algorithm (CSA) in optimizing the control variables of power system operation in solving the optimal reactive power dispatch (ORPD) problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  17. 17
    An improved electromagnetism-like mechanism algorithm for the optimization of maximum power point tracking / Tan Jian Ding

    An improved electromagnetism-like mechanism algorithm for the optimization of maximum power point tracking / Tan Jian Ding by Tan, Jian Ding

    Published 2017
    “…The Electromagnetism-Like Mechanism algorithm (EM) is a meta-heuristic algorithm designed to search for global optimum solutions using bounded variables. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Metaheuristics for the waste collection vehicle routing problem with time windows

    Metaheuristics for the waste collection vehicle routing problem with time windows by Benjamin, Aida Mauziah, Beasley, J. E.

    Published 2010
    “…In this problem there is a set of customers which waste is collected by vehicles.Vehicles can visit waste disposal facilities during their working day to empty collected waste and hence continue to collect from customers.The vehicles start and end their routes at a single depot empty.We take into consideration time windows associated with customers, disposal facilities and the depot.Here, we also have a driver rest period.The problem is solved using a number of metaheuristic algorithms namely tabu search (TS) and variable neighbourhood search (VNS).More over, we also present a combined metaheuristic algorithm based on variable neighbourhood tabu search (VNTS).Where the variable neighbourhood is searched via tabu search.Computational experiments on ten publicly available waste collection benchmark problems involving up to 2092 customers and 19 waste disposal facilities indicates that the proposed algorithms are able to find better quality solutions than previous work presented in literature within reasonable computation times.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Dynamic probability selection for flower pollination algorithm based on metropolis-hastings criteria

    Dynamic probability selection for flower pollination algorithm based on metropolis-hastings criteria by Zamli, Kamal Zuhairi, Din, Fakhrud, Nasser, Abdullah, Ramli, Nazirah, Mohamed, Noraini

    Published 2021
    “…Having only one parameter control (i.e. the switch probability, pa) to choose from the global search (i.e. exploration) and local search (i.e. exploitation) is the main strength of FPA as compared to other meta-heuristic algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Deterministic Mutation-Based Algorithm for Model Structure Selection in Discrete-Time System Identification

    Deterministic Mutation-Based Algorithm for Model Structure Selection in Discrete-Time System Identification by Abd Samad, Md Fahmi

    Published 2011
    “…A deterministic mutation-based algorithm is introduced to overcome this problem. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: