Search Results - (( job application ((tree algorithm) OR (bees algorithm)) ) OR ( _ application force algorithm ))

Refine Results
  1. 1

    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
  2. 2
  3. 3

    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
  4. 4
  5. 5
  6. 6

    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
  7. 7

    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
  8. 8
  9. 9

    Transparency improvement by external force estimation in a time-delayed nonlinear bilateral teleoperation system by Amini, H., Rezaei, S.M., Sarhan, A.A.D., Akbari, J., Mardi, N.A.

    Published 2015
    “…Experimental results confirm the efficiency of the novel control algorithm in position tracking and force reflection.…”
    Get full text
    Get full text
    Article
  10. 10

    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
  11. 11

    Virtual Force Algorithm and Cuckoo Search algorithm for node placement technique in wireless sensor network by Ahmad, Puteri Azwa, Mahmuddin, Massudi, Omar, Mohd Hasbullah

    Published 2013
    “…Wireless Sensor Network (WSN) has become one of the current technologies in the world of information technology.Coverage and connectivity are the main requirement that reflects the performance and quality of services in WSN applications.In WSN applications with a large scale area, the sensor nodes are deployed randomly in a noninvasive way.The deployment process will cause some issues such as coverage hole and overlapping that reflect to the performance of coverage area and connectivity.Node placement model is constructed to find the optimal node placement.Virtual Force Algorithm (VFA) and Cuckoo Search (CS) algorithm approach for node placement technique is analyzed to find the optimal node placement in order to improve the network coverage and connectivity with a minimum coverage hole and overlapping area.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12
  13. 13
  14. 14

    Active force control with iterative learning control algorithm for a vehicle suspension by Rosmazi, Rosli

    Published 2013
    “…The research focuses on the application of an active force control (AFC) strategy with iterative learning control (ILC) algorithms to compensate for the various introduced road profiles or 'disturbances' in a quarter car suspension system as an improvement to ride comfort performance. …”
    Get full text
    Get full text
    Thesis
  15. 15

    A real-time algorithm of optical tactile sensor for surface characterization / Nurul Fathiah Mohamed Rosli by Mohamed Rosli, Nurul Fathiah

    Published 2016
    “…The overall image analysis technique involves the following algorithms: image acquisition (capturing of images), processing (thresholding, noise filtering and boundary detection) and recognition (force measurement). …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20