DASL: An Index for Enhancing Tail Latency, Microarchitecture Friendliness, and Restructuring Overhead by Hojin Shin, Gunhee Choi, Bryan S. Kim, Seehwan Yoo, Jongmoo Choi

Get full text

An Overview and Comparison of Traditional Motion Planning Based on Rapidly Exploring Random Trees by Yang Chu, Quanlin Chen, Xuefeng Yan

“…Motion planning is a fundamental problem in robotics that involves determining feasible or optimal paths within finite time. While complete motion planning algorithms are guaranteed to converge to a path solution in finite time, they are proven to be computationally inefficient, making them unsuitable for most practical problems. …”
Get full text

A Golden Jackal based optimal operation and optimization of a virtual power plant involving renewable resources by Anubhav Kumar Pandey, Chaima Mansour, Nandini K. K., Vinay Kumar Jadoun, Jayalakshmi N. S.

“…Furthermore, the scheduling of the VPP system is carried out on a day-ahead basis and the outcome in terms of cost and emission is compared with the available work in the literature and the result reveals the effectiveness of the system in terms of quality solutions sets for the objectives, minimum computational time and better convergence behavior. In particular, there is a reduction in cost by 2.1% and 0.62% when compared with the salp swarm algorithm and beluga whale algorithm followed by 2.12% and 1.18% in emission. …”
Get full text

Optimization of Backpropagation (BP) Weight Values Using Particle Swarm Optimization (PSO) to Predict KIP Scholarship Recipients by Dika Kurnia Nanda, Dian Palupi Rini

Get full text

Estimation of Quantum Fisher Information via Stein's Identity in Variational Quantum Algorithms by Mourad Halla

“…The Quantum Fisher Information Matrix (QFIM) plays a crucial role in quantum optimization algorithms such as Variational Quantum Imaginary Time Evolution and Quantum Natural Gradient Descent. …”
Get full text

Optimal entanglement distribution within a multi-ring topology by B. C. Ciobanu, T. A. Calafeteanu, A. B. Popa, R. Tătăroiu, P. G. Popescu

“…We provide a comprehensive analysis of the proposed algorithms through computer simulations, which indicate that the additional complexity of a network which allows switching between ring layers brings little benefit in terms of time to serve requests, but may reduce the number of resources needed to satisfy the entanglement distribution requests in a non-blocking manner.…”
Get full text

An investigation of optimality and controllability for quasilinear impulsive evolution systems in abstract spaces by B. Radhakrishnan, P. Anukokila, M. Tamilarasi, P. Shanmugasundram

Get full text

Chemical Reaction Optimization for Minimum Weight Dominating Set by A. Pritam Khan Boni, B. Md. Rafiqul Islam

Get full text

Numerical thermodynamic-economic study and machine learning-based optimization of an innovative biogas-driven integrated power plant combined with sustainable liquid CO2 and liquid... by Ruijia Yuan, Fan Shi, Azher M. Abed, Mohamed Shaban, Sarminah Samad, Ahmad Almadhor, Barno Abdullaeva, Mouloud Aoudia, Salem Alkhalaf, Samah G. Babiker

Get full text

Optimal QoM in Multichannel Wireless Networks Based on MQICA by Na Xia, Lina Xu, Chengchun Ni

“…In this paper, a Multiple-Quantum-Immune-Clone-Algorithm- (MQICA-) based solution was proposed to achieve the optimal channel allocation. …”
Get full text

Development and investigation of parallel model of bee colony algorithms for cryptanalysis problem solving by Yury O Chernyshev, Alexander S Sergeev, Alexander N Ryazanov, Evgeny O. Dubrov

“…Theoretical estimates of time complexity of the bee colony algorithm are given as the key data. Besides, the problem solution is provided: to find the required smallest number of processors of the homogeneous parallel computing systems with distributed memory, and a uniform plan for the implementation of operators for them, for the cryptanalysis algorithm based on the constructed information-logical graph data-logical graph, and for the preset time. …”
Get full text

Delay constraint minimum interruption routing algorithm for mobile satellite network by ZHANG Tao, LIU Zhong-kan, ZHANG Jun

“…By the analysis of the characteristics of mobile satellite network,such as a long delay and a topological time-varying,a novel satellite network delay constraint optimal path（SDCOP）algorithm,which could obtain a path to sat-isfy the delay constraint condition as well as the minimization of interruption during the service,was proposed.This algo-rithm exploits the predictive nature of connectivity changes of time-varying topological to decrease the influence in the QoS routing performance caused by the handover.Besides,it has a low computing complexity to adapt to the restricted computing capability of satellite equipments.Correlative simulation indicates that this novel algorithm is superior to other current algo-rithm in respect of computing complexity,service blocking probability and interrupting probability etc.…”
Get full text

Delay constraint minimum interruption routing algorithm for mobile satellite network by ZHANG Tao, LIU Zhong-kan, ZHANG Jun

“…By the analysis of the characteristics of mobile satellite network,such as a long delay and a topological time-varying,a novel satellite network delay constraint optimal path（SDCOP）algorithm,which could obtain a path to sat-isfy the delay constraint condition as well as the minimization of interruption during the service,was proposed.This algo-rithm exploits the predictive nature of connectivity changes of time-varying topological to decrease the influence in the QoS routing performance caused by the handover.Besides,it has a low computing complexity to adapt to the restricted computing capability of satellite equipments.Correlative simulation indicates that this novel algorithm is superior to other current algo-rithm in respect of computing complexity,service blocking probability and interrupting probability etc.…”
Get full text

A Genetic-Algorithm-Based Approach for Task Migration in Pervasive Clouds by Weishan Zhang, Shouchao Tan, Qinghua Lu, Xin Liu, Wenjuan Gong

“…During task migration, there are possibly a number of conflicting objectives to be considered when making migration decisions, such as less energy consumption and quick response, in order to find an optimal migration path. In this paper, we propose a genetic algorithms- (GAs-) based approach which is effective in addressing multiobjective optimization problems. …”
Get full text

Estimating the Significance of Computer Model Factors Based on a Simple Neural Network by Volodymyr Pepelyaev, Nataliia Oriekhova, Ihor Lukyanov

“…The existing means of computer technology provide an opportunity to develop models of any complexity. …”
Get full text

Solving Transport Infrastructure Investment Project Selection and Scheduling Using Genetic Algorithms by Karel Ječmen, Denisa Mocková, Dušan Teichmann

“…In computational experiments, the proposed GA is compared to an exact solution and proves to be efficient in terms of quality of obtained solutions and computational time, with an average computational time of 108 s and the quality of obtained solutions typically ranging between 85% and 95% of the optimal solution. …”
Get full text

HR Management Big Data Mining Based on Computational Intelligence and Deep Learning by Genliang Zhao, Zhe Xue

Get full text

On the Use of Perfect Sequences and Genetic Algorithms for Estimating the Indoor Location of Wireless Sensors by M. Ferreira, J. Bagarić, Jose M. Lanza-Gutierrez, S. Priem-Mendes, J. S. Pereira, Juan A. Gomez-Pulido

Get full text

Evaluation of the Performance of Unsupervised Learning Algorithms for Intrusion Detection in Unbalanced Data Environments by Gutierrez-Portela Fernando, Almenares Mendoza Florina, Calderon-Benavides Liliana

“…Results showed that K-means++ achieved 95% purity with 95% and 99% prediction accuracies for normal and abnormal data, respectively, while I-forest delivered similar results and excelled in computational efficiency, consuming only 10% of CPU resources compared to 16% for other algorithms. …”
Get full text

Examining prospective mathematics teachers’ computational thinking through the lens of cognitive style by Swasti Maharani, Ardiana Ardiana, Tri Andari

“…This study underscores the importance of developing CT training programs that are adaptive to students’ cognitive styles in order to optimize their potential in mathematical problem-solving. …”
Get full text