Search Results - (( based election problems algorithm ) OR ( java implication force algorithm ))

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

    Effect of negative campaign strategy of election algorithm in solving optimization problem by Hamza Abubakar, Saratha Sathasivam, Shehab Abdulhabib Alzaeemi

    Published 2020
    “…Election algorithm (EA) is an optimization technique based on minimization and coalition operations to solve competition among neurons. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Local search heuristics for elective surgery scheduling considering patient urgency by Rashid, N. S. A., Rahmin, N. A. A., Leong, W. J., Mohamed Ali, Nazihah

    Published 2019
    “…An integer linear programming model is referred to solve the problem. As the model consume a high computational time to solve for a large-scale instance, we developed a local search algorithm based on a simple heuristic to deal with the problem. …”
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    An efficient up-link load reduction model based on clustering in vanets by Abbas Al-Sallami, Ali Hashim

    Published 2019
    “…EULR model consisted of three parts: the first part, two novel algorithms Smart CH Election (SCHE) and Hybrid Cluster-Head Election (HCHE) to increase cluster stability and reduce the number of CHs changes in the network by selecting the best vehicle as cluster head (CH) based on two dynamic thresholds. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

    Unequal clustering in wireless sensor network: A review by Al-Ani K.W., Abdullah F.B., Yossuf S.

    Published 2023
    “…The comparison between the various mechanisms was based on cluster head election process, cluster properties, simulation parameters and energy efficiency to highlight a more efficient and scalable unequal clustering algorithm for WSN. � 2021 Institute of Advanced Engineering and Science. …”
    Article
  5. 5
  6. 6

    Semantic-Based, Scalable, Decentralized and Dynamic Resource Discovery for Internet-Based Distributed System by Hassan, Mahamat. I, Azween, Abdullah

    Published 2010
    “…DA describes the service capabilities based on the ontology, and RA carries the service requests based on the ontology as well. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Semantic-Based, Scalable, Decentralized and Dynamic Resource Discovery for Internet-Based Distributed System by HASSAN, MAHAMAT ISSA

    Published 2010
    “…DA describes the service capabilities based on the ontology, and RA I carries the service requests based on the ontology as well. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Public healthcare facility planning in Malaysia : Using location allocation models / S. Sarifah Radiah Shariff by S. Sarifah Radiah, Shariff

    Published 2012
    “…Two basic location allocation models with two different objectives are studied: The p-median problem and the Maximal Covering Location Problem (MCLP). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis