An Automated Profile-Likelihood-Based Algorithm for Fast Computation of the Maximum Likelihood Estimate in a Statistical Model for Crash Data by Issa Cherif Geraldo

“…Even if there exist many algorithms considered as performing, they can suffer in some cases for one or many of the following criteria: global convergence (capacity of an algorithm to converge to the true unknown solution from all starting guesses), numerical stability (ascent property), implementation feasibility (for example, algorithms requiring matrix inversion cannot be implemented when the involved matrices are not invertible), low computation time, low computational complexity, and capacity to handle high dimensional problems. …”
Get full text

Intuitionistic Fuzzy Possibilistic C Means Clustering Algorithms by Arindam Chaudhuri

“…Some advantages of algorithms are simplicity, flexibility, and low computational complexity. The algorithm is evaluated through cluster validity measures. …”
Get full text

Positioning accuracy improvement in high‐speed GPS receivers using sequential extended Kalman filter by Narges Rahemi, Mohammad Reza Mosavi

“…Here, a comprehensive method is proposed to solve the accuracy issue of the single‐frequency GPS receiver at high‐speed motions without increasing the computational complexity. Suitable modelling of the GPS receivers at high‐speed motion, using the sequential extended Kalman filter, correct determination of the process noise covariance matrix and accurately estimating the variance of the observations are the basics of the proposed approach. …”
Get full text

Adaptive Differentiator-Based Predefined-Time Control for Nonlinear Systems Subject to Pure-Feedback Form and Unknown Disturbance by Man Yang, Qiang Zhang, Ke Xu, Ming Chen

“…An adaptive predefined-time controller is designed by introducing the finite-time differentiator which is used to decrease the computational complexity problem appeared in the traditional backstepping control. …”
Get full text

Performance Analysis of MIMO-STBC Systems with Higher Coding Rate Using Adaptive Semiblind Channel Estimation Scheme by Ravi Kumar, Rajiv Saxena

“…Semiblind channel estimation method provides the best trade-off in terms of bandwidth overhead, computational complexity and latency. The result after using multiple input multiple output (MIMO) systems shows higher data rate and longer transmit range without any requirement for additional bandwidth or transmit power. …”
Get full text

Anonymous whistleblowers reply scheme based on secret sharing by HE Kun, HUANG Yajing, DU Ruiying, SHI Min, LI Siqin, CHEN Jing

“…The experimental results show that compared to the Express scheme, the proposed scheme reduces the computational complexity during a reply to <italic>O</italic>(1) from <italic>O</italic>(log<italic>N</italic>), resulting in a 60% reduction in computational overhead for the receiving organization and a 50% reduction for the server.…”
Get full text

Marker and source-marker reprogramming of Most Permissive Boolean networks and ensembles with BoNesis by Paulevé, Loïc

“…In each case, we give an upper bound on their theoretical computational complexity, and give an implementation of the resolution using the BoNesis Python framework. …”
Get full text

Graphical Optimization Method for Symmetrical Bidirectional Corridor Progression by Kai Lu, Shuyan Jiang, Yiming Zhao, Yongjie Lin, Yinhai Wang

“…The graphical progression method can obtain grand coordinated schemes with minimal computational complexity. However, there is no standardized solution for this method, and only a few related studies have been found thus far. …”
Get full text

Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem by Ho-Yoeng Yun, Suk-Jae Jeong, Kyung-Sup Kim

“…The TSP, in general, is well known as an NP-complete problem, whose computational complexity increases exponentially by increasing the number of cities. …”
Get full text

Suboptimal Greedy Power Allocation Schemes for Discrete Bit Loading by Waleed Al-Hanafy, Stephan Weiss

“…We demonstrate how these schemes can significantly reduce the computational complexity required for power allocation, particularly in the case of a large number of subchannels. …”
Get full text

Fully Pipelined Implementation of Tree-Search Algorithms for Vector Precoding by Maitane Barrenechea, Mikel Mendicute, Egoitz Arruti

“…Nevertheless, the optimality of these algorithms has been assessed mainly in terms of error-rate performance and computational complexity, leaving the hardware cost of their implementation an open issue. …”
Get full text

A New Collision Avoidance Approach for Automated Guided Vehicle Systems Based on Finite State Machines by Mustafa COBAN, Gokhan GELEN

“…The presented approach uses the decentralized node-based approach to reduce computational complexity. The proposed method has been validated through simulation performed with vehicle applications that can move both unidirectional and bidirectional. …”
Get full text

Augmented Lagrange Based on Modified Covariance Matching Criterion Method for DOA Estimation in Compressed Sensing by Weijian Si, Xinggen Qu, Lutao Liu

“…This minimization problem is shown to be a semidefinite program (SDP) and transformed into a constrained quadratic programming problem for reducing computational complexity which can be solved by the augmented Lagrange method. …”
Get full text

Fast Visual Tracking with Enhanced and Gradient-Guide Network by Dun Cao, Renhua Dai

“…Firstly, we adopt the lightweight ResNet-34 as the backbone to improve the proposed tracker’s speed by reducing the computational complexity, and then, to compensate for the performance loss caused by the lightweight backbone, we embed the SKNet from the attention mechanism to filter out the valueless features, and finally, we utilize the gradient-guide strategy to update the template timely. …”
Get full text

Optimal Error Estimate of Chebyshev-Legendre Spectral Method for the Generalised Benjamin-Bona-Mahony-Burgers Equations by Tinggang Zhao, Xiaoxian Zhang, Jinxia Huo, Wanghui Su, Yongli Liu, Yujiang Wu

“…By using the proposed method, the computational complexity is reduced and both accuracy and efficiency are achieved. …”
Get full text

DOA Estimation for Sources with Large Power Differences by Qingyuan Fang, Mengzhe Jin, Weidong Liu, Yong Han

“…Numerical results indicate that the improved algorithm increases the probability of resolution while maintaining the estimation accuracy and computational complexity.…”
Get full text

A multiscale approach to a linear programming problem for calculating a refractive optical element forming a given far-field illumination distribution by D.V. Soshnikov, A.A. Mingazov, L.L. Doskolovich

“…The direct solution of this type of problem presents a huge computational complexity. To overcome this difficulty we use the so-called multiscale approach based on constructing a chain of approximations that are solutions on refining grids.…”
Get full text

On Modelling and Comparative Study of LMS and RLS Algorithms for Synthesis of MSA by Ahmad Kamal Hassan, Adnan Affandi

“…Our findings point to higher accuracies in approximation for synthesis of MSA using RLS algorithm as compared with that of LMS approach; however the computational complexity increases in the former case.…”
Get full text

An Improved Extended Information Filter SLAM Algorithm Based on Omnidirectional Vision by Jingchuan Wang, Weidong Chen

“…Traditional algorithms bring enormous computational complexity to omnidirectional vision SLAM. An improved extended information filter SLAM algorithm based on omnidirectional vision is presented in this paper. …”
Get full text

Sparse Representation Based Range-Doppler Processing for Integrated OFDM Radar-Communication Networks by Bo Kong, Yuhao Wang, Henry Leung, Xiaohua Deng, Huilin Zhou, Fuhui Zhou

“…Additionally, a Doppler frequency detector is exploited to decrease the computational complexity. Numerical simulations show that the proposed method outperforms the traditional modulation Symbol-Domain method under ideal and realistic nonideal scenarios.…”
Get full text