Search Results - (( simulation organization structure algorithm ) OR ( java implication based algorithm ))

Refine Results
  1. 1

    Bead-sort algorithm for load shuffling in miniload AS/RS with an open-rack structure by Vasili, Mohammadreza, Tang, Sai Hong, Ismail, Napsiah, Sulaiman, Shamsuddin, Wong, Shaw Voon, Vasili, Mehdi

    Published 2009
    “…Bead-sort algorithm and a cellular automaton (CA) are used for defining and simulating of load shuffling in this AS/RS, respectively. …”
    Get full text
    Get full text
    Conference or Workshop Item
  2. 2
  3. 3
  4. 4

    Self-organizing network technique for resource allocation and mobility management in LTE femtocell network / Labeeb Mohsin Abdullah by Abdullah, Labeeb Mohsin

    Published 2015
    “…MATLAB and Vienna LTE simulators were used to conduct the experiments for the proposed algorithms, approaches and schemes and also used to verify the results. …”
    Get full text
    Get full text
    Thesis
  5. 5

    An integrated algorithm of analytical network process with case-based reasoning to support the selection of an ideal football team formation and players by Mohammad Zukuwwan, Zainol Abidin

    Published 2021
    “…The system is organized into two combined components: weight calculation for each player to estimate their strength and simulation for suitable formation when facing opponents. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    Self-Organizing Network technique for resource allocation and mobility management in LTE femtocell network / Labeeb Mohsin Abdullah by Abdullah, Labeeb Mohsin

    Published 2016
    “…MATLAB and Vienna LTE simulators were used to conduct the experiments for the proposed algorithms, approaches and schemes and also used to verify the results……”
    Get full text
    Get full text
    Book Section
  8. 8
  9. 9
  10. 10

    Even-odd scheduling based energy efficient routing for wireless sensor network (WSN) / Muhammad Zafar Iqbal Khan by Khan, Muhammad Zafar Iqbal

    Published 2022
    “…The performance of the proposed routing algorithm has been evaluated through simulations of well-known software MATLAB. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Energy Efficient LEACH (EE-LEACH) Routing Algorithm for Wireless Sensor Networks by Pillay, Kosheila Sundram

    Published 2019
    “…Low energy adaptive clustering hierarchy (LEACH) routing protocol was developed to provide better energy efficiency in WSN due to its structural organization. However, it does not guarantee a balanced selection of cluster heads (CHs) and equal cluster size, resulting in an imbalanced load distribution among the CHs. …”
    Get full text
    Get full text
    Thesis
  12. 12

    An improved energy-efficient clustering protocol to prolong the wireless sensor network lifetime by Alhmood, Ali Abdul-Hussian Hassan

    Published 2021
    “…The simulation results prove that the IEECP prolongs the network lifetime better than Energy efficient clustering protocol based on K-means (EECPK-means)-midpoint algorithm (EECPK-means), Traffic-Aware Channel Access Algorithm (TACAA), and an optimal clustering mechanism based on Fuzzy C-means (OCM–FCM) protocols based on the First node die and Weighted first node die. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13

    A cluster-based hybrid replica control protocol for high availability in data grid by Mabni, Zulaile

    Published 2019
    “…CBH employs a hybrid replication strategy by combining the advantages of two common replica control protocols to improve the performance of the existing protocols. A clustering algorithm has been proposed to group the large nodes into clusters and organize these clusters into a tree structure. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Out-of-core simplification with appearance preservation for computer game applications by Tan, Kim Heok

    Published 2006
    “…The first process is to convert the input data into a memory efficient format. Next, datasets are organized in an octree structure and later partitioned meshes are kept in secondary memory (hard disk). …”
    Get full text
    Get full text
    Thesis
  15. 15

    Out-of-core simplification with appearance preservation for computer game applications by Bade, Abdullah, Daman, Daut, Sunar, Mohd. Shahrizal, Tan , Kim Heok

    Published 2006
    “…The first process is to convert the input data into a memory efficient format. Next, datasets are organized in an octree structure and later partitioned meshes are kept in secondary memory (hard disk). …”
    Get full text
    Get full text
    Monograph
  16. 16

    The development of level of detail (LOD) technique in 3D computer graphics application by Ismail, Nor Anita Fairos, Daman, Daut, Mohd. Rahim, Mohd. Shafry

    Published 2009
    “…Next, the datasets are organized in an octree structure and later the partitioned meshes are kept in secondary memory (hard disk). …”
    Get full text
    Get full text
    Monograph
  17. 17
  18. 18

    Performance Analysis of Swarm Intelligence-Based Routing Protocol for Mobile Ad Hoc Network and Wireless Mesh Networks by Moghanjoughi, Ayyoub Akbari

    Published 2009
    “…By this procedure, IANRA is able to prevent some of the existing difficulties in AntNet, MACO and Ad hoc On Demand Distance Vector (AODV) routing algorithms. OMNeT++ was used to simulate the IARNA algorithm for WMNs and MANET. …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20