Parameterised complexity analysis of evolutionary algorithms for combinatorial optimization problems [PDF]
, 2017 Evolutionary algorithms are general problem solvers that have been successfully used in solving combinatorial optimization problems. However, due to the great amount of randomness in these algorithms, theoretical understanding of them is quite ...
Pourhassan, Mojgan
core +3 more sources
Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems [PDF]
Journal of Optimization Theory and Applications, 2020 The Levenberg-Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems. Across different modified variations of the basic procedure, the algorithm enjoys global convergence, a competitive worst case iteration complexity rate, and a guaranteed rate of local convergence for both zero and ...
El Houcine Bergou +2 more
openaire +4 more sources
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
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
Improved complexity bounds in Wasserstein barycenter problem [PDF]
, 2021 In this paper, we focus on computational aspects of the Wasserstein barycenter problem. We propose two algorithms to compute Wasserstein barycenters of m discrete measures of size n with accuracy $\e$.
Dvinskikh, Darina, Tiapkin, Daniil
core +1 more source
Time complexity analysis of evolutionary algorithms for 2-hop (1,2)-minimum spanning tree problem [PDF]
Theoretical Computer Science, 2021 The Minimum Spanning Tree problem (abbr. MSTP) is a well-known combinatorial optimization problem that has been extensively studied by the researchers in the field of evolutionary computing to theoretically analyze the optimization performance of evolutionary algorithms.
Feng Shi 0003 +2 more
openaire +3 more sources
On the Descriptive Complexity of Color Coding
, 2021 Color coding is an algorithmic technique used in parameterized complexity theory to detect “small” structures inside graphs. The idea is to derandomize algorithms that first randomly color a graph and then search for an easily-detectable, small color ...
Max Bannach, Till Tantau
core +1 more source
On a Nonsmooth Gauss–Newton Algorithms for Solving Nonlinear Complementarity Problems [PDF]
, 2020 In this paper, we propose a new version of the generalized damped Gauss–Newton method for solving nonlinear complementarity problems based on the transformation to the nonsmooth equation, which is equivalent to some unconstrained optimization problem ...
Marek J. Śmietański +1 more
core +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