Search Results - (( loading optimization max algorithm ) OR ( java applications usage algorithm ))

Search alternatives:

  • Showing 1 - 6 results of 6
Refine Results
  1. 1
    Improvement of Centralized Routing and Scheduling Using Cross-Layer Design and Multi-Slot Assignment in Wimax Mesh Networks

    Improvement of Centralized Routing and Scheduling Using Cross-Layer Design and Multi-Slot Assignment in Wimax Mesh Networks by Al-Humairi, Ali Zuhair Abdulameer

    Published 2009
    “…This thesis proposes an optimized strategy namely cross-layer design in routing algorithms used find the best route for all SSs and scheduling algorithms, used to assign a time slot for each possible node transmission. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    An Effective Fast Searching Algorithm for Internet Crawling Usage

    An Effective Fast Searching Algorithm for Internet Crawling Usage by Chia, Zhen Hon, Nor Azhar, Ahmad

    Published 2016
    “…The search algorithm is a crucial part in any internet applications. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    Adaptive and optimized radio resource allocation algorithms for OFDMA based networks

    Adaptive and optimized radio resource allocation algorithms for OFDMA based networks by Saadat, Md. Nazmus

    Published 2015
    “…Thus, in this thesis, an adaptive and optimized radio resource allocation algorithm (AORAA) with cross-layer mechanism is proposed. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network

    Interference avoidance routing and scheduling using multiple transceivers for IEEE 802.16 mesh network by Qasem, Yaaqob Ali Ahmed

    Published 2010
    “…Here, a routing tree is constructed based on the energy/bit minimization routing (EbMR). This algorithm looks for a short path from the subscriber station (SS) node to BS, while the optimal path is achieved when the whole path has the lowest EbMR. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Mining Sequential Patterns using I-PrefixSpan

    Mining Sequential Patterns using I-PrefixSpan by Saputra , Dhany, Dayang R.A. Rambli, Foong, Oi Mean

    Published 2008
    Get full text
    Get full text
    Citation Index Journal
    Save to List
    Saved in:
  6. 6
    Mining Sequential Patterns Using I-PrefixSpan

    Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

    Published 2007
    “…The experimental result shows that using Java 2, this method improves the speed of PrefixSpan up to almost two orders of magnitude as well as the memory usage to more than one order of magnitude.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: