Search Results - (( job application ((bee algorithm) OR (tree algorithm)) ) OR ( _ application based algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3

    Content-based recommender system for an academic social network / Vala Ali Rohani by Vala Ali, Rohani

    Published 2014
    “…The algorithm exploits all interests and preferences in a hierarchy tree structure. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Multi objective bee colony optimization framework for grid job scheduling by Alyaseri, Sana, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.Job scheduling problem is one of the key issues because of high heterogeneous and dynamic nature of resources and applications in the grid computing environment.Bee colony approach has been used to solve this problem because it can be easily adapted to the grid scheduling environment.The bee algorithms have shown encouraging results in terms of time and co st.In this paper a framework for multi objective bee colony optimization is proposed to schedule batch jobs to available resources where the number of jobs is greater than the number of resources.Pareto analysis and k-means analysis are integrated in the bee colony optimization algorithm to facilitate the scheduling of jobs to resources.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5
  6. 6

    Bee foraging behaviour techniques for grid scheduling problem by Alyaseri, Sana, Ku-Mahamud, Ku Ruhana

    Published 2013
    “…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.These resources are collected together to make a huge computing power.Job scheduling problem is one of the key issues in grid computing and failing to look into grid scheduling results in uncompleted view of the grid computing.Achieving optimized performance of grid system, and matching application requirements with available computing resources, are the objectives of grid job scheduling.Bee colony approaches are more adaptive to grid scheduling due to high heterogeneous and dynamic nature of resources and applications in grid.These algorithms have shown encouraging results in terms of time and cost.This paper presents some resent research activities inspired by bee foraging behavior for grid job scheduling especially ABC and BCO approaches.Different original studies related to this area are briefly described along with their comparisons against them and results.The review summary of their derived algorithms and research efforts is done.…”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

    Published 2020
    “…There are 4 path planning algorithms will be compared, which are Dijkstra’s algorithm, A* algorithm, RapidExploring Random Tree (RRT) algorithm, and the last one is an algorithm modified from A*. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  8. 8

    Deploying clustered wireless sensor network by multi-robot system by Arezoumand, Reza, Mashohor, Syamsiah

    Published 2014
    “…In this method robots act as dispenser for wireless nodes. Using spanning tree as exploration algorithm helps robot to full coverage deployment of nodes. …”
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9
  10. 10

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

    Published 2011
    “…There are several block-matching algorithm based on block-based motion estimation techniques have been developed. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  11. 11
  12. 12

    Compiler-based prefetching algorithm for recursive data structure by Anuar, Nurulhaini

    Published 2007
    “…This project investigates compiler-based prefetching for pointer based applications particularly those containing Recursive Data Structures (RDS) and designs the proposed algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    Enhancing the QoS performance for mobile station over LTE and WiMAX networks / Mhd Nour Hindia by Hindia, Mhd Nour

    Published 2015
    “…On the second level, TOPSIS algorithm allocates resources among an application’s user based on their criteria and the application’s preferences. …”
    Get full text
    Get full text
    Thesis
  14. 14

    A simulation based fly optimisation algorithm for swarms of mini autonomous surface vehicles application by Zainal Abidin, Zulkifli

    Published 2011
    “…Present paper intends to provide a detailed description of a new bio-inspired Metaheuristic Algorithm. Based on the detailed study of the Drosophila, the flowchart behaviour for the algorithm, code implementation, methodologies and simulation analysis, a novel Fly Optimization Algorithm (FOA) approach is presented. …”
    Get full text
    Get full text
    Get full text
    Article
  15. 15

    Cluster Analysis of Data Points using Partitioning and Probabilistic Model-based Algorithms by Raheem, Ajiboye Adeleke, Hauwau, Isah-Kebbe, O., Oladele Tinuke

    Published 2014
    “…This study explores the performance accuracies of partitioning-based algorithms and probabilistic model-based algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Adaptive beamforming algorithm based on Simulated Kalman Filter by Kelvin Lazarus, Lazarus

    Published 2017
    “…Some of the metaheuristic algorithms have been modified from the original algorithms to improve the algorithms performance in adaptive beamforming application. …”
    Get full text
    Get full text
    Thesis
  17. 17

    IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

    Published 2018
    “…In this study, we are looking at the performance of four graph-based path planning algorithms which is Breadth First Search, Depth First Search, Dijkstra and A*, when implemented in real world applications. …”
    Get full text
    Get full text
    Final Year Project
  18. 18

    Harmony Search-Based Fuzzy Clustering Algorithms For Image Segmentation by Alia, Osama Moh’d Radi

    Published 2011
    “…Various images from different application domains, including synthetic and real-world images, have been used in this thesis to show the applicability of the proposed algorithms. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Multi-base number representation in application to scalar multiplication and pairing computation by Mohammed Ismail, Abdelwahed

    Published 2011
    “…Multi-bases number representation is used to construct new versions of Miller’s algorithm. …”
    Get full text
    Get full text
    Thesis
  20. 20