Suchergebnisse - Complexity analysis of algorithms

Regional complexity analysis of algorithms for nonconvex smooth optimization von Curtis, Frank E., Robinson, Daniel P.

“… A strategy is proposed for characterizing the worst-case performance of algorithms for solving nonconvex smooth optimization problems …”
Volltext

Regional complexity analysis of algorithms for nonconvex smooth optimization von Curtis, Frank E., Robinson, Daniel P.

“… Not provided …”
Volltext

New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces von Romaguera, S., Tirado, P., Valero, O.

“… ] introduced the theory of complexity (quasi-metric) spaces as a part of the development of a topological foundation for the asymptotic complexity analysis of programs and algorithms in 1995 …”
Volltext

Scott’s Qualitative Fixed Point Technique in Complexity Analysis of Algorithms von Lopez-Ramirez, Maria, Valero, Oscar

Volltext

A new contribution to the fixed point theory in partial quasi-metric spaces and its applications to asymptotic complexity analysis of algorithms von Mohammadi, Zahra, Valero, Oscar

“… In this paper we continue the study of fixed point theory in partial quasi-metric spaces and its usefulness in complexity analysis of algorithms …”
Volltext

On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms von Shahzad, Naseer, Valero, Oscar, Alghamdi, Mohammed A, Alghamdi, Maryam A

“… Finally, the applicability of the exposed results is illustrated providing a methodology to determine the asymptotic upper bound of the complexity of those algorithms whose running time of computing …”
Volltext

Editorial: Surveys in Algorithm Analysis and Complexity Theory, Part II (Special Issue) von Jansson, Jesper

“… This is the second Special Issue of surveys published by the MDPI journal Algorithms [...] …”
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. Identical and parallel capacitated machines constitute the …”
Volltext

Editorial: Surveys in Algorithm Analysis and Complexity Theory (Special Issue) von Jansson, Jesper

“… This is a Special Issue of the open-access journal Algorithms consisting of surveys in theoretical computer science [...] …”
Volltext

Puiseux series solutions of ODEs von Ali Ayad, Ali Fares, Youssef Ayyad, Raafat Tarraf

“… We also study the binary complexity of computing such solutions. We will prove that this complexity bound is single exponential in the number of terms in the series …”
Volltext

Regional Complexity Analysis of Algorithms for Nonconvex Smooth Optimization von Curtis, Frank E, Robinson, Daniel P

“… A strategy is proposed for characterizing the worst-case performance of algorithms for solving nonconvex smooth optimization problems …”
Volltext

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

“… 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 …”
Volltext

3D Urban UAV Relay Placement: Linear Complexity Algorithm and Analysis von Chen, Junting, Mitra, Urbashi, Gesbert, David

“… Optimal unmanned aerial vehicle (UAV) placement in a 3-dimensional (3D) space to build a connection between a base station (BS) and a ground user is studied …”
Volltext

On aggregation of normed structures von Martín, J., Mayor, G., Valero, O.

“… In 1981, Borsik and Doboš studied in depth the problem of how to merge, by means of a function, a collection (not necessarily finite) of distance spaces in …”
Volltext

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

“… A reason for this relatively low degree of popularity is the lack of a well developed system of theory and algorithms to support the applications, as is the case for its convex counterpart …”
Volltext

The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis von LaRusic, John, Punnen, Abraham P.

“… Various lower bound algorithms are proposed and the relative strengths of each of these bounds are examined using theoretical and experimental analysis. A polynomial time ⌈n/2 …”
Volltext

Complexity analysis of algorithms in algebraic computation von Sharma, Vikram

“… Numerical computations with real algebraic numbers require algorithms for isolating and approximating real roots of polynomials …”
Volltext

Big-O Time Complexity Analysis Of Algorithm von Phalke, Swapnil, Vaidya, Yogita, Metkar, Shilpa

“… Time complexity describes the amount of time taken by the computer to run a code by counting the number of operations performed in an algorithm …”
Volltext

Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations von Jin, Shi, Liu, Nana, Yu, Yue

“… We construct quantum algorithms to compute the solution and/or physical observables of nonlinear ordinary differential equations (ODEs …”
Volltext

Probabilistic Robustness Analysis—Risks, Complexity, and Algorithms von Chen, Xinjia, Zhou, Kemin, Aravena, Jorge

“… with essentially any desired accuracy and confidence using algorithms with complexity that is linear in the dimension of the uncertainty space …”
Volltext