Search Results - (( developing based m algorithm ) OR ( java optimization sensor algorithm ))

Refine Results
  1. 1

    SecPath: Energy efficient path reconstruction in wireless sensor network using iterative smoothing by Abd, Wamidh Jwdat

    Published 2019
    “…Wireless sensor networks operate through commonly self-organized sensor nodes to transfer data in a multi-hop approach to a central sink. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Energy efficient path reconstruction in wireless sensor network using iPath by Hasan, Sazlinah, Abd, Wamidh Jwdat, Ariffin, Ahmad Alauddin

    Published 2019
    “…Wireless sensor networks operate through commonly self-organized sensor nodes to transfer data in a multi-hop approach to a central sink. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    Anfis Modelling On Diabetic Ketoacidosis For Unrestricted Food Intake Conditions by Saraswati, Galuh Wilujeng

    Published 2017
    “…The project has also implemented the optimization process onto the proposed ANFIS model through the hybrid of Genetic Algorithm on the fuzzy membership function of the ANFIS model. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem by M., Muziana, Kamal Z., Zamli

    Published 2015
    “…Viewing as optimization problem and focusing on two machines, this research aims to develop a new Simulated Annealing based scheduling algorithm, called SA2M, for flow shop problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13

    Makespan algorithms and heuristic for internet-based collaborative manufacturing process using bottleneck approach by Bareduan, Sallehahmad, Hasan, Sulaiman

    Published 2010
    “…It was shown that using bottleneck-based analysis, effective makespan algorithms and constructive heuristic can be developed to solve for near-optimal scheduling sequence. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20