Search Results - (( java implementation tree algorithm ) OR ( program execution search algorithm ))

Search alternatives:

Refine Results
  1. 1
    A guided dynamic programming approach for DNA sequence similarity search

    A guided dynamic programming approach for DNA sequence similarity search by Mohd Nordin Abdul Rahman

    Published 2011
    “…Similarity search procedure is executed by an alignment process between query and targeted sequences. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    Efficient task scheduling strategies using symbiotic organisms search algorithm for cloud computing environment

    Efficient task scheduling strategies using symbiotic organisms search algorithm for cloud computing environment by Sa'ad, Suleiman

    Published 2022
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  3. 3
    Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun

    Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun by Harun, Hazaruddin

    Published 2015
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Study and Implementation of Data Mining in Urban Gardening

    Study and Implementation of Data Mining in Urban Gardening by Mohana, Muniandy, Lee, Eu Vern

    Published 2019
    “…Using the J48 tree algorithm implemented through WEKA API on a Java Servlet, data provided is processed to derive a health index of the plant, with the possible outcomes set to “Good,” “Okay”, or “Bad”. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    Some metaheuristic algorithms for solving multiple cross-functional team selection problems

    Some metaheuristic algorithms for solving multiple cross-functional team selection problems by Ngo, S.T., Jaafar, J., Izzatdin, A.A., Tong, G.T., Bui, A.N.

    Published 2022
    “…The problem solver needs to scan across a large array of available solutions during their search. This problem belongs to a class of combinatorial and NP-Hard problems that requires an efficient search algorithm to maintain the quality of solutions and a reasonable execution time. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    A filtering algorithm for efficient retrieving of DNA sequence

    A filtering algorithm for efficient retrieving of DNA sequence by Abdul Rahman, Mohd Nordin, Mohd. Saman, Md. Yazid, Ahmad, Aziz, Md. Tap, Abu Osman

    Published 2009
    “…Similarity search procedure is executed by an alignment process between query and targeted sequences. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    An analysis on the applicability of meta-heuristic searching techniques for automated test data generation in automatic programming assessment

    An analysis on the applicability of meta-heuristic searching techniques for automated test data generation in automatic programming assessment by Musa, Ja’afar, Romli, Rohaida, Yusoff, Nooraini

    Published 2019
    “…Several recent MHST are included in the comparative evaluation combining both the local and global search algorithms ranging from the year of 2000 until 2018. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde

    Adoption of machine learning algorithm for analysing supporters and non supporters feedback on political posts / Ogunfolajin Maruff Tunde by Ogunfolajin Maruff , Tunde

    Published 2022
    “…The method was implemented using Java and the results of the simulation were evaluated using five standard performance metrics: accuracy, AUC, precision, recall, and f-Measure. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Generalized Fibonacci search for optimization of unconstrained one-and two-dimensional unimodal functions

    Generalized Fibonacci search for optimization of unconstrained one-and two-dimensional unimodal functions by Chong, Chin Yoon *

    Published 2023
    “…We develop a macro program in Microsoft Excel to execute the algorithm of the Swing Descent method to optimize a number of two-dimensional benchmark functions. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems

    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

    Published 2018
    “…This thesis studies multiobjective UTSP consisting of frequency setting, timetabling, simultaneous bus and driver scheduling by applying Multiple Tabu Search (MTS) algorithm. Metaheuristic methods have been widely applied to solve UTSP which is a NP-hard problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    A novel algorithm for collaborative behavior of multi-robot in autonomous reconnaissance

    A novel algorithm for collaborative behavior of multi-robot in autonomous reconnaissance by Khan, Md. Raisuddin, Billah, Md. Masum, Ahmed, Mohiuddin, Abdul Aziz, Normaziah

    Published 2011
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  12. 12
    An evaluation of Monte Carlo-based hyper-heuristic for interaction testing of industrial embedded software applications.

    An evaluation of Monte Carlo-based hyper-heuristic for interaction testing of industrial embedded software applications. by S. Ahmed, Bestoun, Enoiu, Eduard, Afzal, Wasif, Kamal Z., Zamli

    Published 2020
    “…The results show the Q-EMCQ is also capable of outperforming the original EMCQ as well as several recent meta/hyper-heuristic including modified choice function, Tabu high-level hyperheuristic, teaching learning-based optimization, sine cosine algorithm, and symbiotic optimization search in clustering quality within comparable execution time.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Cubic spline based particle swarm optimization for microstrip antennas

    Cubic spline based particle swarm optimization for microstrip antennas by Moniruzzaman, Md., Islam, Md. Rafiqul, Kamaruzzaman , Sopian, Saleem , H. Zaidi

    Published 2011
    “…Using the generated data, the CSPSO program is developed and executed. Thus the optimized antenna is obtained. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Petri Net Algorithm for controlling and monitoring system

    Petri Net Algorithm for controlling and monitoring system by Mohamad Shaiful, Osman

    Published 2009
    Get full text
    Working Paper
    Save to List
    Saved in:
  16. 16
    Unit commitment in power system using multi-agent evolutionary programming incorporating priority listing optimisation technique / Muhammad Nazree Che Othman

    Unit commitment in power system using multi-agent evolutionary programming incorporating priority listing optimisation technique / Muhammad Nazree Che Othman by Che Othman, Muhammad Nazree

    Published 2013
    “…The search process then being refined using heuristic EP-based algorithm with multi-agent approach to produce the final solution. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Network reconfiguration and control for loss reduction using genetic algorithm

    Network reconfiguration and control for loss reduction using genetic algorithm by Jawad, Mohamed Hassan Izzaldeen

    Published 2010
    “…Tests have shown that the differences are demonstrated only in execution time to arrive the best fitness function of the Genetic Algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    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
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution

    Solving vehicle routing problem by using improved K-nearest neighbor algorithm for best solution by Mohammed, Mazin Abed, Abd Ghani, Mohd Khanapi, Hamed, Raed Ibraheem, A. Mostafa, Salama, Ahmed Ibrahim, Dheyaa, Jameel, Humam Khaled, Alallah, Ahmed Hamed

    Published 2017
    “…The structure of the algorithm is designed so that the program does not require a large database to store the population, which speeds up the implementation of the program execution to obtain the solution; secondly, the algorithm has proven its success in solving the problem and finds a shortest route. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Sub-route reversal repair mechanism and differential evolution for urban transit network design problem

    Sub-route reversal repair mechanism and differential evolution for urban transit network design problem by Tarajo, Buba Ahmed

    Published 2017
    “…As a further extension, a hybrid DE-PSO for the UTNDP is developed as a multiobjective combinatorial optimization that produces a set of routes that take into account the interest of users and operators for a given set of resource-and-service constraints. All proposed algorithms are executed using Python programming language, and the computational results show that the proposed algorithms improve the best-so-far results from the literature in most cases.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: