Complexity-Theoretic Limitations on Quantum Algorithms for Topological Data Analysis [PDF]
PRX Quantum, 2022 Quantum algorithms for topological data analysis (TDA) seem to provide an exponential advantage over the best classical approach while remaining immune to dequantization procedures and the data-loading problem. In this paper, we give complexity-theoretic
Alexander Schmidhuber, S. Lloyd
semanticscholar +1 more source
Comparative analysis of machine learning methods for active flow control [PDF]
Journal of Fluid Mechanics, 2022 Machine learning frameworks such as genetic programming and reinforcement learning (RL) are gaining popularity in flow control. This work presents a comparative analysis of the two, benchmarking some of their most representative algorithms against global
F. Pino +3 more
semanticscholar +1 more source
EEG-based real-time diagnostic system with developed dynamic 2TEMD and dynamic ApEn algorithms
Frontiers in Physiology, 2023 In real-time electroencephalography (EEG) analysis, the problem of observing dynamic changes and the problem of binary classification is a promising direction. EEG energy and complexity are important evaluation metrics in brain death determination in the
Ran Zhang +5 more
doaj +1 more source
Optimal recombination in genetic algorithms for combinatorial optimization problems: Part II [PDF]
Yugoslav Journal of Operations Research, 2014 This paper surveys results on complexity of the optimal recombination problem (ORP), which consists in finding the best possible offspring as a result of a recombination operator in a genetic algorithm, given two parent solutions. In Part II, we
Eremeev Anton V., Kovalenko Julia V.
doaj +1 more source
Comparative analysis of the essential CPU scheduling algorithms
Bulletin of Electrical Engineering and Informatics, 2021 CPU scheduling algorithms have a significant function in multiprogramming operating systems. When the CPU scheduling is effective a high rate of computation could be done correctly and also the system will maintain in a stable state.
H. K. Omar +2 more
semanticscholar +1 more source
A deterministic algorithm for the discrete logarithm problem in a semigroup
Journal of Mathematical Cryptology, 2022 The discrete logarithm problem (DLP) in a finite group is the basis for many protocols in cryptography. The best general algorithms which solve this problem have a time complexity of O(NlogN)O\left(\sqrt{N}\log N) and a space complexity of O(N)O\left ...
Tinani Simran, Rosenthal Joachim
doaj +1 more source
Mean-Field Controls with Q-Learning for Cooperative MARL: Convergence and Complexity Analysis [PDF]
SIAM Journal on Mathematics of Data Science, 2020 Multi-agent reinforcement learning (MARL), despite its popularity and empirical success, suffers from the curse of dimensionality. This paper builds the mathematical framework to approximate cooperative MARL by a mean-field control (MFC) framework, and ...
Haotian Gu +3 more
semanticscholar +1 more source
Level-Based Analysis of Genetic Algorithms and Other Search Processes [PDF]
bioRxiv, 2014 Understanding how the time-complexity of evolutionary algorithms (EAs) depend on their parameter settings and characteristics of fitness landscapes is a fundamental problem in evolutionary computation.
Dogan Corus +3 more
semanticscholar +1 more source
Low-Complexity Multi-User Detection Based on Gradient Information for Uplink Grant-Free NOMA
IEEE Access, 2020 Massive machine type communication (mMTC) serves an irreplaceable role in the development process of the Internet of Things (IoT). Because of its characteristics of massive connection and sporadic transmission, compressed sensing (CS) has been applied in
Fang Jiang +4 more
doaj +1 more source
Volumetric Barrier Cutting Plane Algorithms for Stochastic Linear Semi-Infinite Optimization
IEEE Access, 2020 In this paper, we study the two-stage stochastic linear semi-infinite programming with recourse to handle uncertainty in data defining (deterministic) linear semi-infinite programming.
Baha Alzalg, Asma Gafour, Lewa Alzaleq
doaj +1 more source