Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

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

    ARTICLE

    Soft Computing Based Metaheuristic Algorithms for Resource Management in Edge Computing Environment

    Nawaf Alhebaishi1, Abdulrhman M. Alshareef1, Tawfiq Hasanin1, Raed Alsini1, Gyanendra Prasad Joshi2, Seongsoo Cho3, Doo Ill Chul4,*

    CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 5233-5250, 2022, DOI:10.32604/cmc.2022.025596

    Abstract In recent times, internet of things (IoT) applications on the cloud might not be the effective solution for every IoT scenario, particularly for time sensitive applications. A significant alternative to use is edge computing that resolves the problem of requiring high bandwidth by end devices. Edge computing is considered a method of forwarding the processing and communication resources in the cloud towards the edge. One of the considerations of the edge computing environment is resource management that involves resource scheduling, load balancing, task scheduling, and quality of service (QoS) to accomplish improved performance. With this motivation, this paper presents new… More >

  • Open Access

    ARTICLE

    A Sustainable WSN System with Heuristic Schemes in IIoT

    Wenjun Li1, Siyang Zhang1, Guangwei Wu2, Aldosary Saad3, Amr Tolba3,4, Gwang-jun Kim5,*

    CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 4215-4231, 2022, DOI:10.32604/cmc.2022.024204

    Abstract Recently, the development of Industrial Internet of Things has taken the advantage of 5G network to be more powerful and more intelligent. However, the upgrading of 5G network will cause a variety of issues increase, one of them is the increased cost of coverage. In this paper, we propose a sustainable wireless sensor networks system, which avoids the problems brought by 5G network system to some extent. In this system, deploying relays and selecting routing are for the sake of communication and charging. The main aim is to minimize the total energy-cost of communication under the precondition, where each terminal… More >

  • Open Access

    ARTICLE

    Task Scheduling Optimization in Cloud Computing by Rao Algorithm

    A. Younes1,*, M. Kh. Elnahary1, Monagi H. Alkinani2, Hamdy H. El-Sayed1

    CMC-Computers, Materials & Continua, Vol.72, No.3, pp. 4339-4356, 2022, DOI:10.32604/cmc.2022.022824

    Abstract Cloud computing is currently dominated within the space of high-performance distributed computing and it provides resource polling and on-demand services through the web. So, task scheduling problem becomes a very important analysis space within the field of a cloud computing environment as a result of user's services demand modification dynamically. The main purpose of task scheduling is to assign tasks to available processors to produce minimum schedule length without violating precedence restrictions. In heterogeneous multiprocessor systems, task assignments and schedules have a significant impact on system operation. Within the heuristic-based task scheduling algorithm, the different processes will lead to a… More >

  • Open Access

    ARTICLE

    Binary Representation of Polar Bear Algorithm for Feature Selection

    Amer Mirkhan1, Numan Çelebi2,*

    Computer Systems Science and Engineering, Vol.43, No.2, pp. 767-783, 2022, DOI:10.32604/csse.2022.023249

    Abstract In most of the scientific research feature selection is a challenge for researcher. Selecting all available features is not an option as it usually complicates the research and leads to performance drop when dealing with large datasets. On the other hand, ignoring some features can compromise the data accuracy. Here the rough set theory presents a good technique to identify the redundant features which can be dismissed without losing any valuable information, however, exploring all possible combinations of features will end with NP-hard problem. In this research we propose adopting a heuristic algorithm to solve this problem, Polar Bear Optimization… More >

  • Open Access

    ARTICLE

    Fuzzy-Based Secure Clustering with Routing Technique for VANETs

    T. S. Balaji1,2, S. Srinivasan3,*, S. Prasanna Bharathi4, B. Ramesh5

    Computer Systems Science and Engineering, Vol.43, No.1, pp. 291-304, 2022, DOI:10.32604/csse.2022.023269

    Abstract Due to the advanced developments in communication technologies, Internet of vehicles and vehicular adhoc networks (VANET) offers numerous opportunities for effectively managing transportation problems. On the other, the cloud environment needs to disseminate the emergency message to the vehicles which are consistently distributed on the roadway so that every vehicle gets the messages from closer vehicles in a straightforward way. To resolve this issue, clustering and routing techniques can be designed using computational intelligence approaches. With this motivation, this paper presents a new type-2 fuzzy sets based clustering with metaheuristic optimization based routing (T2FSC-MOR) technique for secure communication in VANET.… More >

  • Open Access

    ARTICLE

    Annealing Harmony Search Algorithm to Solve the Nurse Rostering Problem

    Mohammed Hadwan1,2,3,*

    CMC-Computers, Materials & Continua, Vol.71, No.3, pp. 5545-5559, 2022, DOI:10.32604/cmc.2022.024512

    Abstract A real-life problem is the rostering of nurses at hospitals. It is a famous nondeterministic, polynomial time (NP) -hard combinatorial optimization problem. Handling the real-world nurse rostering problem (NRP) constraints in distributing workload equally between available nurses is still a difficult task to achieve. The international shortage of nurses, in addition to the spread of COVID-19, has made it more difficult to provide convenient rosters for nurses. Based on the literature, heuristic-based methods are the most commonly used methods to solve the NRP due to its computational complexity, especially for large rosters. Heuristic-based algorithms in general have problems striking the… More >

  • Open Access

    ARTICLE

    Gaining-Sharing Knowledge Based Algorithm for Solving Stochastic Programming Problems

    Prachi Agrawal1, Khalid Alnowibet2, Ali Wagdy Mohamed3,4,*

    CMC-Computers, Materials & Continua, Vol.71, No.2, pp. 2847-2868, 2022, DOI:10.32604/cmc.2022.023126

    Abstract This paper presents a novel application of metaheuristic algorithms for solving stochastic programming problems using a recently developed gaining sharing knowledge based optimization (GSK) algorithm. The algorithm is based on human behavior in which people gain and share their knowledge with others. Different types of stochastic fractional programming problems are considered in this study. The augmented Lagrangian method (ALM) is used to handle these constrained optimization problems by converting them into unconstrained optimization problems. Three examples from the literature are considered and transformed into their deterministic form using the chance-constrained technique. The transformed problems are solved using GSK algorithm and… More >

  • Open Access

    ARTICLE

    Reactions’ Descriptors Selection and Yield Estimation Using Metaheuristic Algorithms and Voting Ensemble

    Olutomilayo Olayemi Petinrin1, Faisal Saeed2, Xiangtao Li1, Fahad Ghabban2, Ka-Chun Wong1,3,*

    CMC-Computers, Materials & Continua, Vol.70, No.3, pp. 4745-4762, 2022, DOI:10.32604/cmc.2022.020523

    Abstract Bioactive compounds in plants, which can be synthesized using N-arylation methods such as the Buchwald-Hartwig reaction, are essential in drug discovery for their pharmacological effects. Important descriptors are necessary for the estimation of yields in these reactions. This study explores ten metaheuristic algorithms for descriptor selection and model a voting ensemble for evaluation. The algorithms were evaluated based on computational time and the number of selected descriptors. Analyses show that robust performance is obtained with more descriptors, compared to cases where fewer descriptors are selected. The essential descriptor was deduced based on the frequency of occurrence within the 50 extracted… More >

  • Open Access

    ARTICLE

    Multi-Objective Adapted Binary Bat for Test Suite Reduction

    Nagwa Reda1, Abeer Hamdy2,*, Essam A. Rashed1,3

    Intelligent Automation & Soft Computing, Vol.31, No.2, pp. 781-797, 2022, DOI:10.32604/iasc.2022.019669

    Abstract Regression testing is an essential quality test technique during the maintenance phase of the software. It is executed to ensure the validity of the software after any modification. As software evolves, the test suite expands and may become too large to be executed entirely within a limited testing budget and/or time. So, to reduce the cost of regression testing, it is mandatory to reduce the size of the test suite by discarding the redundant test cases and selecting the most representative ones that do not compromise the effectiveness of the test suite in terms of some predefined criteria such as… More >

  • Open Access

    ARTICLE

    A survey on the Metaheuristics for Cryptanalysis of Substitution and Transposition Ciphers

    Arkan Kh Shakr Sabonchi*, Bahriye Akay

    Computer Systems Science and Engineering, Vol.39, No.1, pp. 87-106, 2021, DOI:10.32604/csse.2021.05365

    Abstract This paper presents state-of-art cryptanalysis studies on attacks of the substitution and transposition ciphers using various metaheuristic algorithms. Traditional cryptanalysis methods employ an exhaustive search, which is computationally expensive. Therefore, metaheuristics have attracted the interest of researchers in the cryptanalysis field. Metaheuristic algorithms are known for improving the search for the optimum solution and include Genetic Algorithm, Simulated Annealing, Tabu Search, Particle Swarm Optimization, Differential Evolution, Ant Colony, the Artificial Bee Colony, Cuckoo Search, and Firefly algorithms. The most important part of these various applications is deciding the fitness function to guide the search. This review presents how these algorithms… More >

Displaying 11-20 on page 2 of 27. Per Page