Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    A Novel Binary Firey Algorithm for the Minimum Labeling Spanning Tree Problem

    Mugang Lin1,2,*, Fangju Liu3, Huihuang Zhao1,2, Jianzhen Chen1,2

    CMES-Computer Modeling in Engineering & Sciences, Vol.125, No.1, pp. 197-214, 2020, DOI:10.32604/cmes.2020.09502 - 18 September 2020

    Abstract Given a connected undirected graph G whose edges are labeled, the minimum labeling spanning tree (MLST) problem is to find a spanning tree of G with the smallest number of different labels. The MLST is an NP-hard combinatorial optimization problem, which is widely applied in communication networks, multimodal transportation networks, and data compression. Some approximation algorithms and heuristics algorithms have been proposed for the problem. Firey algorithm is a new meta-heuristic algorithm. Because of its simplicity and easy implementation, it has been successfully applied in various fields. However, the basic firefly algorithm for the MLST problem More >

  • Open Access

    ARTICLE

    QoS-Aware Energy-Efficient Task Scheduling on HPC Cloud Infrastructures Using Swarm-Intelligence Meta-Heuristics

    Amit Chhabra1, *, Gurvinder Singh2, Karanjeet Singh Kahlon2

    CMC-Computers, Materials & Continua, Vol.64, No.2, pp. 813-834, 2020, DOI:10.32604/cmc.2020.010934 - 10 June 2020

    Abstract Cloud computing infrastructure has been evolving as a cost-effective platform for providing computational resources in the form of high-performance computing as a service (HPCaaS) to users for executing HPC applications. However, the broader use of the Cloud services, the rapid increase in the size, and the capacity of Cloud data centers bring a remarkable rise in energy consumption leading to a significant rise in the system provider expenses and carbon emissions in the environment. Besides this, users have become more demanding in terms of Quality-of-service (QoS) expectations in terms of execution time, budget cost, utilization,… More >

  • Open Access

    ARTICLE

    Genetic-Frog-Leaping Algorithm for Text Document Clustering

    Lubna Alhenak1, Manar Hosny1,*

    CMC-Computers, Materials & Continua, Vol.61, No.3, pp. 1045-1074, 2019, DOI:10.32604/cmc.2019.08355

    Abstract In recent years, the volume of information in digital form has increased tremendously owing to the increased popularity of the World Wide Web. As a result, the use of techniques for extracting useful information from large collections of data, and particularly documents, has become more necessary and challenging. Text clustering is such a technique; it consists in dividing a set of text documents into clusters (groups), so that documents within the same cluster are closely related, whereas documents in different clusters are as different as possible. Clustering depends on measuring the content (i.e., words) of… More >

  • Open Access

    ARTICLE

    Structural System Identification Using Quantum behaved Particle Swarm Optimisation Algorithm

    A. Rama Mohan Rao1, K. Lakshmi1, Karthik Ganesan2

    Structural Durability & Health Monitoring, Vol.9, No.2, pp. 99-128, 2013, DOI:10.32604/sdhm.2013.009.099

    Abstract Development of efficient system identification techniques is highly relevant for large civil infrastructure for effective health monitoring, damage detection and vibration control. This paper presents a system identification scheme in time domain to estimate stiffness and damping parameters of structures using measured acceleration. Instead of solving the system identification problem as an inverse problem, we formulate it as an optimisation problem. Particle swarm optimisation (PSO) and its other variants has been a subject of research for the past few decades for solving complex optimisation problems. In this paper, a dynamic quantum behaved particle swarm optimisation… More >

Displaying 31-40 on page 4 of 34. Per Page