Search Results - (( problem solving protocol algorithm ) OR ( java application scheduling algorithm ))

Refine Results
  1. 1

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…The CPU profiler of JavaTM VisualVM measures the number of invocations of scheduling event handlers (procedures) in each algorithm as well as the total time spent in all invocations of this handler. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2

    Deniable authentication protocol based on factoring and discrete logarithm problems by Nek Abd Rahman, Normahirah, Ismail, Eddie Shahril, Laham, Mohamed Faris

    Published 2022
    “…The security of the algorithm depends on how difficult it is to simultaneously solve factoring and discrete logarithm problems.…”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Performance of Ad-Hoc on-Demand Distance Vector Discovery Algorithms Based On Packet Lifetime by Ahmad, Noor Azlan

    Published 2008
    “…The combination metrics of the lifetime and the sequence number in the table entry is used to solve the problem of the discarded active path information when the lifetime is expired. …”
    Get full text
    Get full text
    Thesis
  4. 4

    A Toolkit for Simulation of Desktop Grid Environment by FOROUSHAN, PAYAM CHINI

    Published 2014
    “…In this type of environment it is nearly impossible to prove the effectiveness of a scheduling algorithm. Hence the main objective of this study is to develop a desktop grid simulator toolkit for measuring and modeling scheduler algorithm performance. …”
    Get full text
    Get full text
    Final Year Project
  5. 5
  6. 6

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

    Published 2006
    “…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Improving Class Timetabling using Genetic Algorithm by Qutishat, Ahmed Mohammed Ali

    Published 2006
    “…This paper reports the power fill techniques using GA in scheduling. Class timetabling problem is one of the applications in scheduling. …”
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Examination timetabling using genetic algorithm case study: KUiTTHO by Mohd Salikon, Mohd Zaki

    Published 2005
    “…This paper reports the powerful techniques using GA in scheduling. Examination timetabling problem is one of the applications in scheduling. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10

    Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO by Mohd. Zaki, Mohd. Salikon

    Published 2005
    “…This paper reports the powerful techniques using GA in scheduling. Examination timetabling problem is one of the applications in scheduling. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    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
    “…Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
    Get full text
    Get full text
    Article
  12. 12

    The influence of students’ concept of mole, problem representation ability and mathematical ability on stoichiometry problem solving by Taha, Hafsah, Hashim, Rosnani, Ismail, Zurida, Jusoff, Kamaruzaman, Khoo, Yin Yin

    Published 2014
    “…The challenge of enhancing students’ performance in solving stoichiometry problems remain a daunting task as many resort to just teaching how solve stoichiometry problems algorithmically. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    MAC Protocol for Opportunistic Spectrum Access in Cognitive Radio System by Armi, Nasrullah, M Saad, M Naufal, Yusoff, Mohd Zuki, Arshad, Muhammad

    Published 2011
    “…The derivation of greedy approach proves that sensing problem can be solved either optimally or approximate the optimal solution. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14
  15. 15

    Performance enhancement of AIMD algorithm for congestion avoidance and control by Jasem, Hayder Natiq

    Published 2011
    “…Additive Increase Multiplicative decrease (AIMD) is one of the best principles offered to solve this problem. This study is also in this field and offers an enhanced version of this mechanism. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Comparison of DSR, AODV and DSDV routing protocols in mobile ad-hoc networks: A survey by Abdala, Tarek Mosbah, Dasalla, Valeriano A., Daud, Nasarudin

    Published 2014
    “…A mobile ad hoc network (MANET) is a collection of mobile nodes that is connected through a wireless medium forming rapidly changing topologies.Mantes are infrastructure less and can be set up anytime, anywhere.We have conducted survey of protocol properties of various MANET routing algorithms and analyzed them.The routing algorithms considered are classified into three categories proactive (table driven) , reactive (on demand) and Hybrid protocol.The algorithms considered are Dynamic Source Routing (DSR), Ad-hoc On-Demand Distance Vector Routing (AODV) and Destination sequence Vector (DSDV) have been proposed to solve the multi hop routing problem in Ad-hoc networks.The comparison among three routing protocols are based on the various protocol property parameters such as Routing overhead, packet delivery ratio, end-to-end delay, path optimality, and throughput are some metrics commonly used in the comparisons.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    A design of redirect link failure protocol based on dynamic source routing for mobile ad hoc networks by Ghazali, Osman, Hassan, Suhaidi, M. Kadhum, Mohammed

    Published 2011
    “…If an alternative route is not available, the source node will reinitiate route discovery process to find a new route, which may result in the decrease of the performance of DSR protocol. Therefore, to avoid this situation, we propose an extension of DSR protocol called Redirect Link Failure Protocol (RLFP) in order to solve link failure problem and update routes in the route cache of DSR protocol.RLFP consists of three parts.The first part is based on Link Prediction Algorithm, which utilises signal power strength from the received packets to predict the link before any break down happens.The second part is based on Link Solution Model, which contains sub-models that can solve and redirect link failure.Finally, the Enhanced Route Cache Model, which possesses a scheme that is called “Updating Route Scheme”, to avoid stale routes.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  18. 18

    Batch mode heuristic approaches for efficient task scheduling in grid computing system by Maipan-Uku, Jamilu Yahaya

    Published 2016
    “…Many algorithms have been implemented to solve the grid scheduling problem. …”
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Performance enhancement of adaptive cluster formation and routing protocols in wireless networks by Khalaf, Osamah Ibrahem

    Published 2017
    “…EBCRA solves the issue of redundant re-transmission of RREQ packet and propose a routing algorithm that deal with the broadcast storm problem which is widely practiced in MANET routing protocol. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Optimal Sensing for Opportunistic Spectrum Access in Cognitive Radio by Armi, Nasrullah, M Saad, M Naufal, Yusoff, Mohd Zuki, Arshad, Muhammad

    Published 2010
    “…The derivation of greedy approach proves that sensing problem can be solved either optimally or approximate the optimal solution. …”
    Get full text
    Get full text
    Article