Improved Laplacian Biogeography-Based Optimization Algorithm and Its Application to QAP by Xinming Zhang, Doudou Wang, Haiyan Chen, Wentao Mao, Shangwang Liu, Guoqi Liu, Zhi Dou

“…Finally, some measures such as example learning, mutation operation removing, and greedy selection are adopted mostly to reduce the computation complexity of LxBBO. A lot of experimental results on the complex functions from the CEC-2013 test set show ILxBBO obtains better performance than LxBBO and quite a few state-of-the-art algorithms do. …”
Get full text

Genetic optimization–based scheduling in maritime cyber physical systems by Tingting Yang, Hailong Feng, Jian Zhao, Ruilong Deng, Ying Wang, Zhou Su

“…In order to cope with the computation complexity of traditional scheduling algorithms in intermittent infostations scenario, time-capacity mapping method is exploited to transfer it to a continue scenario when classic scheduling algorithms could be utilized with lower time complexity. …”
Get full text

Fast Skyline Community Search in Multi-Valued Networks by Dongxiao Yu, Lifang Zhang, Qi Luo, Xiuzhen Cheng, Jiguo Yu, Zhipeng Cai

“…However, the algorithms proposed on skyline community search can only work in the special case that the nodes have different values on each attribute, and the computation complexity degrades exponentially as the number of attributes increases. …”
Get full text

A kurtosis-ESPRIT algorithm for RealTime stability assessment in droop controlled microgrids by Adham Osama, Abdallah F. El-Hamalawy, Mohammed E. Ammar, Amr M. AbdelAty, Hatem H. Zeineldin, Tarek H. M. EL-Fouly, Ehab F. El-Saadany

“…Abstract Although detailed analytical models for droop-controlled microgrids are available, they are computationally complex and do not consider real-time variations in microgrid parameters and operating conditions. …”
Get full text

ZenLDA: Large-Scale Topic Model Training on Distributed Data-Parallel Platform by Bo Zhao, Hucheng Zhou, Guoqiang Li, Yihua Huang

“…The novelty of ZenLDA consists of three main aspects: (1) it converts the commonly used serial Collapsed Gibbs Sampling (CGS) inference algorithm to a Monte-Carlo Collapsed Bayesian (MCCB) estimation method, which is embarrassingly parallel; (2) it decomposes the LDA inference formula into parts that can be sampled more efficiently to reduce computation complexity; (3) it proposes a distributed LDA training framework, which represents the corpus as a directed graph with the parameters annotated as corresponding vertices and implements ZenLDA and other well-known inference methods based on Spark. …”
Get full text

Smart Home Security: An Efficient Multi-Factor Authentication Protocol by Ghazaleh Sarbishaei, Amir Masoud Aminian Modarres, Farahnaz Jowshan, Fateme Zahra Khakzad, Hasti Mokhtari

“…Evaluating the computation complexity and space complexity of the proposed protocol also verifies its superior performance compared with similar schemes.…”
Get full text

Testing convolutional neural network based deep learning systems: a statistical metamorphic approach by Faqeer ur Rehman, Clemente Izurieta

“…Metamorphic testing (MT) is considered a simple but very powerful approach in testing such computationally complex systems for which either an oracle is not available or is available but difficult to apply. …”
Get full text

Enhanced crayfish optimization algorithm: Orthogonal refracted opposition-based learning for robotic arm trajectory planning. by Yuefeng Leng, Chunlai Cui, Zhichao Jiang

“…In high-dimensional scenarios, trajectory planning is a challenging and computationally complex optimization task that requires finding the optimal trajectory within a complex domain. …”
Get full text

LMF-Net: A Learnable Multimodal Fusion Network for Semantic Segmentation of Remote Sensing Data by Jihao Li, Wenkai Zhang, Weihang Zhang, Ruixue Zhou, Chongyang Li, Boyuan Tong, Xian Sun, Kun Fu

“…Experiments on two well-established benchmark datasets reveal that our LMF-Net possesses superior segmentation behavior and strong generalization capability. In terms of computation complexity, it achieves competitive performance as well. …”
Get full text

LFN-YOLO: precision underwater small object detection via a lightweight reparameterized approach by Mingxin Liu, Mingxin Liu, Yujie Wu, Ruixin Li, Cong Lin, Cong Lin

“…Experiments conducted on public datasets, including URPC, Brackish, and TrashCan, showed that the mAP@0.5 reached 74.1%, 97.5%, and 66.2%, respectively, with parameter sizes and computational complexities of 2.7M and 7.2 GFLOPs, and the model size is only 5.9 Mb. …”
Get full text

Spatiotemporal models with confounding effects: application on under-five mortality across four sub-Saharan African countries by Haile Mekonnen Fenta, Haile Mekonnen Fenta, Ding-Geng Chen, Ding-Geng Chen, Temesgen T. Zewotir, Najmeh Nakhaei Rad

“…However, when the number of time points and spatial areas is large and the areas are disconnected, fitting the model becomes computationally complex because of the high number of required parameters to be estimated. …”
Get full text