-
41
Adaptive Hierarchical Collocation Method for Solving Fractional Population Diffusion Model
Published 2023-01-01“…The algorithm’s complexity analysis illustrates the concise function’s efficiency advantage over the original expression when solving time-fractional PDEs. …”
Get full text
Article -
42
The Blockchain Trilemma: A Formal Proof of the Inherent Trade-Offs Among Decentralization, Security, and Scalability
Published 2024-12-01“…Our analysis includes a proof by contradiction and computational complexity analysis. This work aims to deepen the understanding of the fundamental limitations of blockchain technology, offering insights for future innovations and helping navigate the inevitable trade-offs.…”
Get full text
Article -
43
A New Quasi-Human Algorithm for Solving the Packing Problem of Unit Equilateral Triangles
Published 2014-01-01“…Some new concepts are put forward such as side-clinging action, and an approximation algorithm for solving the addressed problem is designed. Time complexity analysis and the calculation results indicate that the proposed method is a polynomial time algorithm, which provides the possibility to solve the packing problem of arbitrary triangles.…”
Get full text
Article -
44
A Heuristic Algorithm for Solving Triangle Packing Problem
Published 2013-01-01“…It is demonstrated that the proposed algorithm is highly efficient, and by the time complexity analysis and the analogue experiment result is found.…”
Get full text
Article -
45
Joint beamforming design for distributed IRS assisted millimeter wave MU-MISO system
Published 2022-04-01“…A joint beamforming design scheme for distributed intelligent reflecting surface (IRS) assisted multi-user communication was proposed to solve the reliable communication problem in the downlink of millimeter-wave multi user-multiple input single output (MU-MISO) system in non line of sight scenarios.Considering the power and constant-mode constraints, the active beamforming of the base station and passive beamforming of multiple IRS were modeled as a joint non-convex optimization problem with the objective of user weighting and sum rate maximization.A closed-form fractional programming technique was used to decouple this joint optimization problem into an easily solvable equivalent problem.A non-convex block coordinate descent algorithm was used to alternately optimize the active beamforming and passive beamforming matrices according to the prox-linear rule and the distributed successive convex approximation rule.The convergence proof and complexity analysis of the proposed algorithm were also given.The simulation results demonstrate that the algorithm can converge fast, and can effectively improve the system transmission rate with reduced complexity compared with the two baseline algorithms.…”
Get full text
Article -
46
An Efficient Two-Objective Hybrid Local Search Algorithm for Solving the Fuel Consumption Vehicle Routing Problem
Published 2016-01-01“…We present a mixed integer programming model for the FCVRP, and fuel consumption is measured through the degree of road gradient. Complexity analysis of FCVRP is presented through analogy with the capacitated VRP. …”
Get full text
Article -
47
A Novel SLM Scheme for PAPR Reduction in OFDM Systems
Published 2011-01-01“…The novel scheme requires only one IFFT and gets more candidate transmission signals throughout the entire process. The complexity analysis and simulation results show that this algorithm can dramatically reduce computational complexity comparing with the conventional SLM scheme as in Hill et al., 2000; Yang et al., 2009; Wang and Ouyang, 2005; Li et al., 2010; and Heo et al., 2007 under the similar PAPR reduction performance.…”
Get full text
Article -
48
λ-Augmented Tree for Robust Data Collection in Advanced Metering Infrastructure
Published 2016-03-01“…Detailed algorithms to create such AMI tree and related theoretical and complexity analysis are provided with insightful simulation results: sufficient redundancy is provided to alleviate data loss at the cost of signaling overhead. …”
Get full text
Article -
49
Improved Clonal Selection Algorithm Based on Biological Forgetting Mechanism
Published 2020-01-01“…Compared with the existing clonal selection and genetic algorithms, the experiment and time complexity analysis show that the algorithm has good optimization efficiency and stability.…”
Get full text
Article -
50
A Bionic Social Learning Strategy Pigeon-Inspired Optimization for Multi-Unmanned Aerial Vehicle Cooperative Path Planning
Published 2025-01-01“…The paper also proves the algorithm’s convergence and provides complexity analysis. Comparison experiments demonstrate that the proposed method searches for the optimal solution while guaranteeing fast convergence. …”
Get full text
Article -
51
Recognizing Boundaries in Wireless Sensor Networks Based on Local Connectivity Information
Published 2014-07-01“…In addition, a message complexity analysis confirms the energy efficiency of the proposed algorithm. …”
Get full text
Article -
52
A hybrid machine learning model for intrusion detection in wireless sensor networks leveraging data balancing and dimensionality reduction
Published 2025-02-01“…This hybrid approach addresses class imbalance and high-dimensionality challenges, providing scalable and robust intrusion detection. Complexity analysis reveals that the proposed model reduces training and prediction times, making it suitable for real-time applications.…”
Get full text
Article -
53
Recent progress in the security evaluation of multivariate public‐key cryptography
Published 2023-03-01“…In particular, the authors provide a detailed description of the complexity analysis for solving the bi‐graded polynomial systems studied independently by Nakamura et al. and Smith‐Tone et al., and then expound the rectangular MinRank attack against Rainbow proposed by Beullens.…”
Get full text
Article -
54
Identifying vital spreaders in large-scale networks based on neighbor multilayer contributions
Published 2025-01-01“…These tests demonstrated the effectiveness of our proposed algorithm in identifying influential spreaders accurately.DiscussionFurthermore, computational complexity analysis indicates that our algorithm consumes less time compared to existing methods, suggesting it can be efficiently applied to large-scale networks.…”
Get full text
Article -
55
Novel and Efficient Randomized Algorithms for Feature Selection
Published 2020-09-01“…We conduct theoretical computational complexity analysis and further explain our algorithms’ generic parallelizability. …”
Get full text
Article -
56
Coupled Dynamics of Vehicle-Bridge Interaction System Using High Efficiency Method
Published 2021-01-01“…This paper studies the accuracy and efficiency of discretizing the beam in space as lumped masses using the flexibility method and as finite elements using the stiffness method. Computational complexity analysis is carried out along with a numerical case study to compare the accuracy and efficiency of both methods against the analytical solutions. …”
Get full text
Article -
57
Central DOA Estimation Method for Exponential-Type Coherent Distributed Source Based on Fourth-Order Cumulant
Published 2020-01-01“…The accuracy and DOF of the proposed algorithm are higher than those of the distributed signal parameter estimator (DSPE) algorithm and least-squares estimation signal parameters via rotational invariance techniques (LS-ESPRIT) algorithm when the array elements are the same. Complexity analysis and numerical simulations are provided to demonstrate the superiority of the proposed method.…”
Get full text
Article -
58
Revisit two memoryless state‐recovery cryptanalysis methods on A5/1
Published 2023-07-01“…Secondly, the filtering strength of the linear equation systems is taken into account for complexity analysis. Such filtering strength are evaluated with practical experiments making the complexities more convincing. …”
Get full text
Article -
59
Strategic Deconfliction of 4D Trajectory and Perturbation Analysis for Air Traffic Control and Automation System
Published 2016-01-01“…The outcomes demonstrated that the planned strategic conflict-free 4D trajectories could avoid potential conflicts, and the slack time could be used to indicate their robustness. Complexity analysis demonstrated that deconfliction using max-plus algebra is more suitable for deconfliction of 4D trajectory with random sampling period in fix air route.…”
Get full text
Article -
60
Quantitative Complexity Theory Used in the Prediction of Head-Up Tilt Testing Outcome
Published 2021-01-01“…The chosen haemodynamic parameters (including BP, HR, stroke volume, cardiac output, systemic vascular resistance) have been used in complexity analysis. Results. HUTT was positive in 54 (66.7%) study participants. …”
Get full text
Article