Suchergebnisse - analysis of algorithms and (problem OR problemy) complexity

Convergence and Complexity Analysis of a Levenberg–Marquardt Algorithm for Inverse Problems von Bergou, El Houcine, Diouane, Youssef, Kungurtsev, Vyacheslav

“… The Levenberg–Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems …”
Volltext

Energy-aware lot sizing problem: Complexity analysis and exact algorithms von Rapine, Christophe, Goisque, Guillaume, Akbalik, Ayse

“… The single-item lot sizing problem under a periodic energy limitation is considered in this paper …”
Volltext

Meta-heuristic search algorithms in truss optimization: Research on stability and complexity analyses von Öztürk, Hasan Tahsin, Kahraman, Hamdi Tolga

“… ) the competitor algorithms used in the optimization process being insufficient, and (iii) the stability analysis and computational complexity information of the algorithms are not investigated …”
Volltext

Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms von Rebennack, Steffen, Prokopyev, Oleg A., Singh, Bismark

“… This fact turns out to be not surprising as we prove that the considered problem is NP‐hard in general, but admits a linear time solution algorithm when the graph is a tree …”
Volltext

Complexity and Algorithms for Superposed Data Uploading Problem in Networks With Smart Devices von Li, Wenjun, Xu, Huayi, Li, Huixi, Yang, Yongjie, Sharma, Pradip Kumar, Wang, Jin, Singh, Saurabh

“… ) or servers can be merged between SDs with a fixed size, which is called superposed data . In this article, we consider the superposed data uploading problem in a decentralized device-to-device communication system …”
Volltext

Complexity analysis and approximation algorithms for the single-machine scheduling problem with workload-dependent maintenance activities von Liu, Peihai, Gu, Manzhan, Lu, Xiwen

“… In the case where the function is concave, we study the computational complexity of the three problems with the goal of minimizing the makespan, the total completion time, and the total weighted …”
Volltext

Zeroth-order algorithms for nonconvex–strongly-concave minimax problems with improved complexities von Wang, Zhongruo, Balasubramanian, Krishnakumar, Ma, Shiqian, Razaviyayn, Meisam

“… In this paper, we study zeroth-order algorithms for minimax optimization problems that are nonconvex in one variable and strongly-concave in the other …”
Volltext

Horse herd optimization algorithm: A nature-inspired algorithm for high-dimensional optimization problems von MiarNaeimi, Farid, Azizyan, Gholamreza, Rashki, Mohsen

“… This paper proposes a new meta-heuristic algorithm inspired by horses’ herding behavior for high-dimensional optimization problems …”
Volltext

Algorithms and Complexity on Indexing Founder Graphs von Equi, Massimo, Norri, Tuukka, Alanko, Jarno, Cazaux, Bastien, Tomescu, Alexandru I., Mäkinen, Veli

“… We study the problem of matching a string in a labeled graph. Previous research has shown that unless the Orthogonal Vectors Hypothesis (OVH …”
Volltext

On the sphere-decoding algorithm I. Expected complexity von Hassibi, B., Vikalo, H.

“… Therefore, in this paper, rather than dwell on the worst-case complexity of the integer least-squares problem, we study its expected …”
Volltext

Complexity of Quantum Impurity Problems von Bravyi, Sergey, Gosset, David

“… We give a quasi-polynomial time classical algorithm for estimating the ground state energy and for computing low energy states of quantum impurity models …”
Volltext

Algorithms and complexity for the almost equal maximum flow problem von Haese, Rebekka, Heller, Till, Krumke, Sven O.

“… In the equal maximum flow problem (EMFP), we aim for a maximum flow where we require the same flow value on all arcs in some given subsets of the arc set, so called homologous arc sets …”
Volltext

Structured nonconvex and nonsmooth optimization: algorithms and iteration complexity analysis von Jiang, Bo, Lin, Tianyi, Ma, Shiqian, Zhang, Shuzhong

“… Nonconvex and nonsmooth optimization problems are frequently encountered in much of statistics, business, science and engineering, but they are not yet widely recognized as a technology in the sense of scalability …”
Volltext

A modified PRP-type conjugate gradient algorithm with complexity analysis and its application to image restoration problems von Chen, Yu, Kuang, Kai, Yan, Xueling

“… Additionally, the complexity analysis of the proposed algorithm is investigated. To reach the point with the norm of the gradient below ɛ …”
Volltext

An efficient algorithm and complexity result for solving the sum of general affine ratios problem von Jiao, Hongwei, Ma, Junqiao

“… In this paper, with the unique hypothesis that the denominator is not equal to 0, an efficient outer space rectangle branch-and-bound algorithm is presented to globally solve the sum of general affine ratios problem …”
Volltext

Coordinated Beamforming for MISO Interference Channel: Complexity Analysis and Efficient Algorithms von Liu, Ya-Feng, Dai, Yu-Hong, Luo, Zhi-Quan

“… of a given group of cell edge users. Assuming perfect channel knowledge, we formulate this problem as the maximization of a system utility …”
Volltext

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems von Le Gall, François, Seddighin, Saeed

“… ) are three fundamental string problems that can be classically solved in near linear time. In this work, we present sublinear time quantum algorithms for these problems along with quantum lower bounds …”
Volltext

A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints von Nip, Kameng, Wang, Zhenbo

“… We study the computational complexity and propose polynomial-time optimal or approximation algorithms …”
Volltext

The maximum l-triangle k-club problem: Complexity, properties, and algorithms von Almeida, Maria Teresa, Brás, Raúl

“… •The computational complexity of the problem is established, for any l ≥ 1 and k ≥ 2.•Cohesiveness properties of graphs induced by l-triangle k-clubs are derived …”
Volltext

New Frontiers in Parameterized Complexity and Algorithms

“… The research on parameterized complexity (PC), described in these peer-reviewed chapters by esteemed researchers, provides ties to practice as well as new theoretical developments, many in the direction of AI …”
Volltext