Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (2)
  • Open Access

    ARTICLE

    A Query-Based Greedy Approach for Authentic Influencer Discovery in SIoT

    Farah Batool1, Abdul Rehman2, Dongsun Kim2,*, Assad Abbas1, Raheel Nawaz3, Tahir Mustafa Madni1

    CMC-Computers, Materials & Continua, Vol.74, No.3, pp. 6535-6553, 2023, DOI:10.32604/cmc.2023.033832 - 28 December 2022

    Abstract The authors propose an informed search greedy approach that efficiently identifies the influencer nodes in the social Internet of Things with the ability to provide legitimate information. Primarily, the proposed approach minimizes the network size and eliminates undesirable connections. For that, the proposed approach ranks each of the nodes and prioritizes them to identify an authentic influencer. Therefore, the proposed approach discards the nodes having a rank (α) lesser than 0.5 to reduce the network complexity. α is the variable value represents the rank of each node that varies between 0 to 1. Node with… More >

  • Open Access

    ARTICLE

    A Clustering-based Approach for Balancing and Scheduling Bicycle-sharing Systems

    Imed Kacem, Ahmed Kadri, Pierre Laroche

    Intelligent Automation & Soft Computing, Vol.24, No.2, pp. 421-430, 2018, DOI:10.31209/2018.100000016

    Abstract This paper addresses an inventory regulation problem in bicycle sharingsystems. The problem is to balance a network consisting of a set of stations by using a single vehicle, with the aim of minimizing the weighted sum of the waiting times during which some stations remain imbalanced. Motivated by the complexity of this problem, we propose a two-stage procedure based on decomposition. First, the network is divided into multiple zones by using two different clustering strategies. Then, the balancing problem is solved in each zone. Finally, the order in which the zones must be visited is More >

Displaying 1-10 on page 1 of 2. Per Page