Search Results - parallel service selection algorithm

Search alternatives:

  • Showing 1 - 5 results of 5
Refine Results
  1. 1

    A scheduling algorithm for WDM optical networks by Cheah, Cheng Lai, Mohd Ali, Borhanuddin, Mukerjee, Malay R., Prakash, Veeraraghavan, Selvadurai, Selvakennedy

    Published 2001
    “…This paper proposes a scheduling algorithm for time-slotted WDM broadcast-and-select optical networks. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Diverse cell interaction in dynamic cell sizing and VC-PGA cell priority selection method by Amphawan, Angela, G, Ezra Moris Abraham

    Published 2002
    “…In this paper, the diverse interaction among cells is discussed.The preliminary description of forward link capacity gain on a single cell serves as groundwork for discussions on bi-directional impact of cell-pairs and the multifarious interactions of cells in a CDMA network.The diverse interaction of cells is then made analogous to that of community members in a virtual community in a genetic algorithm.The cell to be given highest priority cell over shrinking in the virtual community is selected by the virtual community parallel genetic algorithm (VC-PGA).By this method, the number of cell attenuations may be controlled, the emergence of coverage holes reduced and thus, the quality of service increased.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Hybrid metaheuristics for QOS-aware service composition / Hadi Naghavipour by Hadi , Naghavipour

    Published 2022
    “…With the advent of Service-Oriented Architecture (SOA), services can be registered, invoked, and combined by their identical Quality of Services (QoS) attributes to create a new value-added application that fulfils user requirements. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    A Fast Scheduling Algorithm for WDM Optical Networks by Cheah, Cheng Lai

    Published 2000
    “…This time complexity can be improved to O(log3 N) by parallel processing using O(M) processors. Two variations of implementation of the scheduling algorithm have been proposed, namely the Variable Frame Size (VFS) and Limited Frame Size (LFS) schemes. …”
    Get full text
    Get full text
    Thesis
  5. 5