Showing 821 - 840 results of 1,410 for search '"Computational complexity theory', query time: 0.25s Refine Results
  1. 821

    Quantum-classical hybrid algorithm for solving the learning-with-errors problem on NISQ devices by Muxi Zheng, Jinfeng Zeng, Wentao Yang, Pei-Jie Chang, Quanfeng Lu, Bao Yan, Haoran Zhang, Min Wang, ShiJie Wei, Gui-Lu Long

    Published 2025-05-01
    “…Abstract The Learning-With-Errors (LWE) problem is a fundamental computational challenge with implications for post-quantum cryptography and computational learning theory. …”
    Get full text
    Article
  2. 822

    Last-Train Timetabling under Transfer Demand Uncertainty: Mean-Variance Model and Heuristic Solution by Shuo Yang, Kai Yang, Ziyou Gao, Lixing Yang, Jungang Shi

    Published 2017-01-01
    “…Through computational experiments involving the Beijing subway system, we demonstrate the computational efficiency of the proposed MV model and the heuristic approach.…”
    Get full text
    Article
  3. 823

    Foundations and Innovations in Data Fusion and Ensemble Learning for Effective Consensus by Ke-Lin Du, Rengong Zhang, Bingchun Jiang, Jie Zeng, Jiabin Lu

    Published 2025-02-01
    “…Additionally, we examine the theoretical foundations of ensemble methods, including bias–variance trade-offs, margin theory, and optimization-based frameworks, while analyzing computational trade-offs related to training complexity, inference efficiency, and storage requirements. …”
    Get full text
    Article
  4. 824

    Rapid Fluid Velocity Field Prediction in Microfluidic Mixers via Nine Grid Network Model by Qian Li, Yuwei Chen, Taotao Sun, Junchao Wang

    Published 2024-12-01
    “…Traditionally, the simulation of these mixers relies on the finite element method (FEM), which, although effective, presents challenges due to its computational complexity and time-consuming nature. To address this, we propose a nine-grid network (NGN) model theory with a centrally symmetric structure.The NGN uses a symmetric structure similar to a 3 × 3 grid to partition the fluid space to be predicted. …”
    Get full text
    Article
  5. 825

    Generalized Shortest Path Problem: An Innovative Approach for Non-Additive Problems in Conditional Weighted Graphs by Adrien Durand, Timothé Watteau, Georges Ghazi, Ruxandra Mihaela Botez

    Published 2024-09-01
    “…This study not only expands the scope of traditional shortest path problems but also highlights their computational complexity and potential solutions.…”
    Get full text
    Article
  6. 826

    A Chemistry-Based Optimization Algorithm for Quality of Service-Aware Multi-Cloud Service Compositions by Mona Aldakheel, Heba Kurdi

    Published 2025-04-01
    “…This novelty of this paper is the chemistry-based approach (CA) that draws inspiration from the periodic table’s organizational principles and electron shell theory to systematically reduce the complexity associated with service composition. …”
    Get full text
    Article
  7. 827

    Predictive channel scheduling algorithm between macro base station and micro base station group by Yinghai XIE, Ruohe YAO, Bin WU

    Published 2019-11-01
    “…A novel predictive channel scheduling algorithm was proposed for non-real-time traffic transmission between macro-base stations and micro-base stations in 5G ultra-cellular networks.First,based on the stochastic stationary process characteristics of wireless channels between stationary communication agents,a discrete channel state probability space was established for the scheduling process from the perspective of classical probability theory,and the event domain was segmented.Then,the efficient scheduling of multi-user,multi-non-real-time services was realized by probability numerical calculation of each event domain.The theoretical analysis and simulation results show that the algorithm has low computational complexity.Compared with other classical scheduling algorithms,the new algorithm can optimize traffic transmission in a longer time dimension,approximate the maximum signal-to-noise ratio algorithm in throughput performance,and increase system throughput by about 14% under heavy load.At the same time,the new algorithm is accurate.Quantitative computation achieves a self-adaption match between the expected traffic rate and the actual scheduling rate.…”
    Get full text
    Article
  8. 828

    Fuzzy Course Tracking Control of Unmanned Surface Vehicle with Actuator Input Quantization and Event-Triggered Mechanism by Qifu Wang, Chenchen Jiang, Jun Ning, Liying Hao, Yong Yin

    Published 2025-03-01
    “…The system control laws are designed based on the backstepping method, combining dynamic surface control technology to mitigate the computational complexity expansion of virtual control laws. …”
    Get full text
    Article
  9. 829

    Single-Pixel Imaging for Partially Occluded Objects by Jingjing Wu, Lifa Hu, Jicheng Wang

    Published 2023-01-01
    “…In traditional optical imaging system, the lenslet array or the reference beam and special algorithms are usually needed to solve this problem, which increase the complexity of the system. As a computational optical imaging technology, the problem of single-pixel imaging (SPI) for an occluded object has not been researched yet as we know. …”
    Get full text
    Article
  10. 830

    Classical simulability of constant-depth linear-optical circuits with noise by Changhun Oh

    Published 2025-07-01
    “…In this work, we investigate the complexity of shallow-depth linear-optical circuits under the effects of photon loss and partial distinguishability. …”
    Get full text
    Article
  11. 831
  12. 832

    A Comprehensive Method for Example-Based Color Transfer with Holistic–Local Balancing and Unit-Wise Riemannian Information Gradient Acceleration by Zeyu Wang, Jialun Zhou, Song Wang, Ning Wang

    Published 2024-10-01
    “…To address the high computational complexity inherent in complex statistical modeling, a parameter estimation method called the unit-wise Riemannian information gradient (uRIG) method is introduced. …”
    Get full text
    Article
  13. 833

    Neurite, a finite difference large scale parallel program for the simulation of electrical signal propagation in neurites under mechanical loading. by Julián A García-Grajales, Gabriel Rucabado, Antonio García-Dopico, José-María Peña, Antoine Jérusalem

    Published 2015-01-01
    “…The simulation of the coupled mechanical and electrophysiological behaviors requires computational expensive calculations that increase in complexity as the network of the simulated cells grows. …”
    Get full text
    Article
  14. 834

    An Adaptive Fusion Path Tracking Strategy for Autonomous Vehicles Based on Improved ACO Algorithm by Jihan Zhang, Yuan Wang, Jinyan Hu, Hongwu You

    Published 2025-01-01
    “…Although methods based on dynamic models and optimization theory can improve tracking performance, most autonomous systems lack high-fidelity models and the complexity of optimization processes lead to increase computational burden. …”
    Get full text
    Article
  15. 835

    Research on Ultra-fine Group Resonance Calculation Method by YANG Weiyan, SHAO Ruizhi, SHI Jun, YANG Bo, BI Guangwen, PENG Lianghui

    Published 2025-06-01
    “…The ultra-fine group resonance calculation method has the advantages of high calculation accuracy and good applicability, which can effectively overcome various disadvantages of equivalent theory method. The only drawback of ultra-fine group method is that the computational efficiency is low for the complex geometry problem because of huge number of energy groups. …”
    Article
  16. 836

    A measure of the difference between test sets for generating controlled random tests by V. N. Yarmolik, V. V. Petrovskaya, I. Mrozek

    Published 2022-12-01
    “…The main attention is paid to binary test sets, when the task of calculating given difference metric is reduced to the classical assignment problem using the Hungarian algorithm. The computational complexity of the Hungarian algorithm is estimated by the relation O(n4). …”
    Get full text
    Article
  17. 837

    Methodological Support for Applying the Method of Majority Reservation in Measuring Channels by N. V. Minchev

    Published 2021-02-01
    “…An algorithm allowing identification of the failure of a channel in a measuring module with a redundant structure was developed. The computational complexity of the developed algorithm is estimated by a polynomial of the second degree.Conclusion. …”
    Get full text
    Article
  18. 838

    Methodology for Determining the Probability of Damage to UAV as a Result of Exposure to Atmospheric Environmental Factors by D. G. Belonozhko, I. D. Korolev, Yu. O. Chernyshev, N. N. Ventsov

    Published 2022-10-01
    “…It takes into account possible atmospheric forcing and enables to determine the probability of damage to the UAV under various atmospheric influences. The computational complexity of the algorithm implementing the technique depends significantly on the number of qualitative assessments of atmospheric impacts on UAV.Results. …”
    Get full text
    Article
  19. 839

    Fast Object Tracking Employing Labelled Particle Filter for Thermal Infrared Imager by Junying Yang, Zhenghao Li, Jingman Xia, Peng Han

    Published 2015-07-01
    “…Therefore, the candidate target template is established only if the label of candidate target matches the label of reference target, and the computational complexity is reduced consequently. Experiments are conducted to show that the proposed algorithm can handle real-time object tracking with less time cost while maintaining high tracking accuracy.…”
    Get full text
    Article
  20. 840