Search · four archives
Search · four archives
16 papers · ranked by Valyu relevance
Deyu Tang, Jie Zhao, Jin Yang, Zhen Liu + 1 more
Shuffled frog leaping algorithm, a novel heuristic method, is inspired by the foraging behavior of the frog population, which has been designed by the shuffled process and the PSO framework. To increase the convergence speed and effectiveness, the currently improved versions are focused on the local search ability in…
Weizhe Zhang, Enci Bai, Hui He, Albert M.K. Cheng + 1 more
'Leonhard M. Reindl'] Reducing energy consumption is becoming very important in order to keep battery life and lower overall operational costs for heterogeneous real-time multiprocessor systems. In this paper, we first formulate this as a combinatorial optimization problem. Then, a successful meta-heuristic, called…
Junwan Liu, Zhoujun Li, Xiaohua Hu, Yiming Chen + 1 more
Background Multi-objective optimization (MOO) involves optimization problems with multiple objectives. Generally, theose objectives is used to estimate very different aspects of the solutions, and these aspects are often in conflict with each other. MOO first gets a Pareto set, and then looks for both commonality and…
Changlong Sun, Zhengzong Wang, Dongwan Lu, Li Cao + 3 more
'Haihua Ding' 'Zhongyi Hu'] Multipath data transmission is a key problem that needs to be solved urgently in wireless sensor networks. In this paper, sensor node failure, link failure, energy exhaustion, and external interference affect the stability and reliability of network data transmission. A multipath…
Zhuanzhe Zhao, Mengxian Wang, Yongming Liu, Yu Chen + 2 more
'Zhibo Liu'] The shuffled frog leaping algorithm (SFLA) is a promising metaheuristic bionics algorithm, which has been designed by the shuffled complex evolution and the particle swarm optimization (PSO) framework. However, it is easily trapped into local optimum and has the low optimization accuracy when it is used to…
Chellamuthu Gunavathi, Kandasamy Premalatha
Feature selection in cancer classification is a central area of research in the field of bioinformatics and used to select the informative genes from thousands of genes of the microarray. The genes are ranked based on T-statistics, signal-to-noise ratio (SNR), and F-test values. The swarm intelligence (SI) technique…
Bestan B. Maaroof, Tarik A. Rashid, Jaza M. Abdulla, Bryar A. Hassan + 4 more
'Abeer Alsadoon' 'Mokhtar Mohammadi' 'Mohammad Khishe' 'Seyedali Mirjalili'] Bestan B. Maaroof1 ; Tarik A. Rashid2 ; Jaza M. Abdulla3,4; Bryar A. Hassan5 ; Abeer Alsadoon6,7; Mokhtar Mohammadi8 ; Mohammad Khishe9 ; Seyedali Mirjalili10,11 1 Information Technology Department, College of Commerce, University of…
Pasura Aungkulanon, Pongchanun Luangpaiboon
Response surface methods via the first or second order models are important in manufacturing processes. This study, however, proposes different structured mechanisms of the vertical transportation systems or VTS embedded on a shuffled frog leaping-based approach. There are three VTS scenarios, a motion reaching a…
Javad Rahimipour Anaraki, Saeed Samet, Mahdi Eftekhari, Chang Wook Ahn
'Chang Wook Ahn'] Feature selection and attribute reduction are crucial problems, and widely used techniques in the field of machine learning, data mining and pattern recognition to overcome the well-known phenomenon of the Curse of Dimensionality, by either selecting a subset of features or removing unrelated ones.…
Mir Hadi Athari, Charles Yang, Zhifang Wang
—The optimization of the size and location of Photovoltaic (PV) Distributed Generation (DG) is a method for reducing distribution networks loss, cutting costs for utilities, and integrating renewable energy into the power grid. However, this optimization problem is a difficult mixed continuous discrete problem that is…
Xinrun Xu, Zhanbiao Lian, Yurong Wu, Manying Lv + 3 more
Rescue in IoT Environment Authors: ['Xinrun Xu' 'Zhanbiao Lian' 'Yurong Wu' 'Manying Lv' 'Zhiming Ding' 'Jian Yan' 'Shang Jiang'] Abstract—Emergency relief operations are essential in disaster aftermaths, necessitating effective resource allocation to minimize negative impacts and maximize benefits. In prolonged crises…
Hongyi Xin, Jeremie Kim, Sunny Nahar, Carl Kingsford + 2 more
Approximate String Matching is a pivotal problem in the field of computer science. It serves as an integral component for many string algorithms, most notably, DNA read mapping and alignment. The improved LV algorithm proposes an improved dynamic programming strategy over the banded Smith-Waterman algorithm but suffers…
Jana Lipková, Georgios Arampatzis, Philippe Chatelain, Bjoern Menze + 1 more
'Petros Koumoutsakos'] Abstract We propose the S-leaping algorithm for the acceleration of Gillespie's stochastic simulation algorithm that combines the advantages of the two main accelerated methods; the τ -leaping and R-leaping algorithms. These algorithms are known to be efficient under different conditions; the τ…
Authors not listed
Stochastic Simulation Algorithms (SSA) are a cornerstone in simulating Free Radical Polymerization (FRP) due to their accuracy and reliability. However, computational inefficiency remains a challenge for large-scale and complex polymerization systems. This work introduces a novel stochastic simulation algorithm…
Dalit Engelhardt, Thomas O. McDonald
The simulation of clonal dynamics with branching processes can provide valuable insights into disease progression and treatment optimization, but exact simulation of branching processes via the Stochastic Simulation Algorithm (SSA) is computationally prohibitive at the large population sizes associated with…
Joseph Briggs, Alex Parker, Coy Schwieder, Chris Wells
Write W(n) to mean the n-letter word obtained by repeating a fixed word W and let Rn denote a uniformly random n-letter word sampled from the same alphabet as W. We are interested in the average length of the longest common subsequence between W(n) and Rn, which is known to be γ(W)·n+o(n) for some constant γ(W). Bukh…